java防御编程_防御导弹（Java代码）解题思路:
经典动态规划解法, dp[i] = 1(i:0~len-1), 向前⼩于等于dp[i]的数，
dp[i] = Math.max(dp[i], dp[j]+1); 记录dp中最⼤的dp[i]为max, 最后结果返回max.
注意事项:
参考代码:import java.util.Scanner;
public class C1264 {
public static void main(String[] args) {
int[] a = new int[20];
int index = 0;
Scanner sc = new Scanner(System.in);
while (sc.hasNext()) {
a[index++] = sc.nextInt();
}
System.out.println(F(a, index));
sc.close();
}
private static int F(int[] a, int len){
int[] dp = new int[len];
dp[0] = 1;
int max = 0;
for(int i = 1; i
dp[i] = 1;
for(int j = i-1; j >= 0; j--){
if(a[j] >= a[i]){
dp[i] = Math.max(dp[i], dp[j]+1);
if(dp[i] > max)
max = dp[i];
}
java爱心代码编程简单}
}
return max;
}
}