只要努力飞翔，即使再弱小的蝴蝶也可以飞的很高
| Run ID | 作者 | 问题 | 语言 | 测评结果 | 分数 | 时间 | 内存 | 代码长度 | 提交时间 |
|---|---|---|---|---|---|---|---|---|---|
| 112124 | 曾煦翔 | 求最长不下降序列 | C++ | 解答错误 | 0 | 12 MS | 252 KB | 576 | 2023-11-25 10:35:23 |
Tests(0/10):
using namespace std; int dp[1005]; int a[1005]; int main() { int n; cin >> n; for(int i = 1;i <= n;i++) cin >> a[i]; int m = 0; for(int i = 0;i < n;i++) { dp[i] = 1; for(int j = 0;j < i;j++) { if(a[i] >= a[j]) dp[i] = max(dp[i] , dp[j] + 1); } m = max(m , dp[i]); } cout << "max=" << m << endl; int b[1005]; int c = 0; for(int i = n - 1;i >= 0;i--) { if(dp[i] == m) { b[c] == a[i]; c++; m--; } } for(int i = c - 1;i >= 0;i--) cout << b[i] << " "; return 0; }
测评信息:
输入
300 250 275 252 200 138 245
输出
max=294
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...
答案
max=2
250 275
系统信息
exit code: 0, checker exit code: 0
输入
14985 12531 10887 19172 19853 17363 16825 23471 11869 7515 17591 21140 7372 18733 11723 19036 8131 5351 16296 2052 10350 28607 13742 5394 9238 3387 6484 8627 6641 9689 29592 23222 21499 4385 4463 103...
输出
答案
max=17
5351 5394 6484 8627 9689 10362 12583 14516 14996 15952 16187 16600 20139 25207 27300 28111 28406
检查日志
Runtime Error:Segmentation fault
系统信息
exit code: 0, checker exit code: 0
输入
554 345 75 178 51 64 28 18 51 51 542 17
输出
max=543
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...
答案
max=3
75 178 542
系统信息
exit code: 0, checker exit code: 0
输入
1989 1220 616 1619 1606 1981 118 123 456 789
输出
答案
max=4
118 123 456 789
检查日志
Runtime Error:Segmentation fault
系统信息
exit code: 0, checker exit code: 0
输入
123 256 369 213 456 956 23 698 1236 321 500 666
输出
max=112
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...
答案
max=6
123 256 369 456 956 1236
系统信息
exit code: 0, checker exit code: 0
输入
9 8 7 9 8 7 9 8 7 55 66 99 88 77 88 963 365 4561
输出
max=4
0 0 0 0
答案
max=9
7 8 9 55 66 77 88 963 4561
系统信息
exit code: 0, checker exit code: 0
输入
399 400 700 200 100 600 800 900 299 400 276
输出
max=389
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...
答案
max=5
399 400 700 800 900
系统信息
exit code: 0, checker exit code: 0
输入
181 205 471 782 1033 1058 1111
输出
max=175
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...
答案
max=7
181 205 471 782 1033 1058 1111
系统信息
exit code: 0, checker exit code: 0
输入
300 150 120 540 360 471 140 364 146 340
输出
max=291
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...
答案
max=4
120 140 146 340
系统信息
exit code: 0, checker exit code: 0
输入
465 978 486 476 324 575 384 278 214 657 218 445 123
输出
max=453
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...
答案
max=4
465 486 575 657
系统信息
exit code: 0, checker exit code: 0