题解 | 最长不下降子序列

import java.util.Scanner;

// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int count = in.nextInt();
        int[] nums = new int[count];
        int[] dp = new int[count];
        for(int i = 0; i < count; i++){
            nums[i] = in.nextInt();
            dp[i] = 1;
        }
        for(int i = 1; i < count; i++){
            for(int j = 0; j < i; j++){
                if(nums[j]<=nums[i]){
                    dp[i] = Math.max(dp[i], dp[j]+1);
                }
            }
        }
        int max = dp[0];
        for(int i = 1; i < count; i++){
            max = Math.max(max, dp[i]);
        }
        System.out.println(max);
    }
}