动态规划算法:递归算法基础上每个子问题只求解一次并保存下来。
import java.util.*;
public class Main{
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n,a;
n = in.nextInt();
a = rod(n);
System.out.print(a);
}
public static int rod(int n) {
int[] price = {1,5,8,9,10,17,17,20,24,30};
int[] r = new int[n+1];
int q;
r[0] = 0;
for(int j=1;j<=n;j++) {
q = -9999999;
for(int i=1;i<=j;i++) {
q = Math.max(q, price[i-1]+r[j-i]);
}
r[j] = q;
}
return r[n];
}
}