参考代码:
import java.util.Arrays; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int[] a = new int[n]; for (int i = 0; i < n; i++) { a[i] = sc.nextInt(); } String[] b = new String[n];//存储路径 int[] dp = new int[n]; dp[0] = 1; for (int i = 0; i < b.length; i++) { b[i] = a[i] + ""; } int max = Integer.MIN_VALUE; for (int i = 1; i < dp.length; i++) { int cnt = 1; int index = i; for (int j = i - 1; j >= 0; j--) { if (a[i] >= a[j]) { if (cnt < dp[j] + 1) { cnt = dp[j] + 1; index = j; } } } dp[i] = cnt; if (i != index) b[i] = b[index] + " " + b[i]; } int index = 0; for (int i = 0; i < dp.length; i++) { if (max < dp[i]) { max = dp[i]; index = i; } } System.out.println("max=" + max); System.out.println(b[index]); } }
0.0分
2 人评分
打水问题 (C语言代码)浏览:1070 |
C语言程序设计教程(第三版)课后习题6.4 (C语言代码)浏览:1031 |
C语言程序设计教程(第三版)课后习题1.5 (C语言代码)浏览:482 |
简单的a+b (C语言代码)浏览:626 |
printf基础练习2 (C语言代码)浏览:644 |
IP判断 (C语言代码)浏览:763 |
C语言程序设计教程(第三版)课后习题9.1 (C语言代码)浏览:681 |
母牛的故事 (C语言代码)浏览:549 |
矩阵乘方 (C语言代码)浏览:1023 |
2^k进制数 (C语言描述,蓝桥杯)浏览:1420 |