解题思路:
注意事项:
参考代码:
import java.util.Arrays; import java.util.Scanner; public class Main { public static void main(String[] args) { //坐标型动态规划 Scanner in = new Scanner(System.in); int n = in.nextInt(); int[] v = new int[n+1]; for (int i = 1; i <= n; i++) { v[i] = in.nextInt(); } int[] dp = new int[n+1];//dp[i]表示以v[i]结尾的最长非严格递增序列 Arrays.fill(dp, 1); int max = Integer.MIN_VALUE; //如果是最长连续单调递增序列 则一遍循环就够了 //但这题是非严格递增序列,需要两重循环 for (int i = 2; i <= n; i++) { for(int j = 1;j<=i-1;j++) { if(v[i]>=v[j])dp[i] = Math.max(dp[i],dp[j] + 1); } if(dp[i] > max)max=dp[i]; } System.out.println(max); } }
0.0分
1 人评分