1. 题目描述
图片来源:https://www.nowcoder.com/discuss/220718?type=0&order=0&pos=5&page=1
2. 代码
方法1(动态规划)81%超时
import java.util.Scanner;
public class Main{ private static int N;//序列长度 public static void main(String[] args) { Scanner sc = new Scanner(System.in); N = sc.nextInt(); int [] val = new int[N];//正整数 for (int i = 0; i < N; i++) { val[i] = sc.nextInt(); } int max = 0; int [] dp = new int[N]; for (int i = 0; i < N; i++) { for (int