参考代码:
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语言训练-斐波纳契数列 (C语言代码)浏览:2827 |
C语言程序设计教程(第三版)课后习题9.8 (Java代码)浏览:1642 |
C语言程序设计教程(第三版)课后习题6.9 (C语言代码)浏览:775 |
C语言程序设计教程(第三版)课后习题6.11 (C语言代码)浏览:2081 |
WU-蓝桥杯算法提高VIP-交换Easy (C++代码)浏览:1119 |
2004年秋浙江省计算机等级考试二级C 编程题(2) (C语言代码)浏览:1341 |
C语言考试练习题_保留字母 (C语言代码)浏览:713 |
简单的a+b (C语言代码)浏览:531 |
永远的丰碑 (C语言代码)浏览:526 |
C语言程序设计教程(第三版)课后习题6.3 (C语言代码)浏览:477 |