拦截导弹 dp java

//求最长降序子序列package 动态规划;import java.util.Scanner;public class 拦截导弹01 {public static void main(String[] args) {Ljdd ljdd = new Ljdd();}}class Ljdd{int n;int[] map;int[] dp;//dp[i]表示以i点为终点的递减子序列的长度public Ljdd(){Scanner sca = new Scanner(System.in);n = sca.nextInt();map = new int[n+1];dp = new int[n+1];for(int i=1;i<=n;i++){dp[i] = 1;map[i] = sca.nextInt();for(int j=i-1;j>=1;j--){if(map[j]<=map[i]){dp[i] = Integer.max(dp[i], dp[j]+1);}}}int max=1;for(int i=1;i<=n;i++){max = dp[i]>max?dp[i]:max;}System.out.println(max);}}