Run ID | 作者 | 问题 | 语言 | 测评结果 | 分数 | 时间 | 内存 | 代码长度 | 提交时间 |
---|---|---|---|---|---|---|---|---|---|
177698 | 王赜晗 | 【C6-11】最长不下降子序列(LIS) | C++ | 解答错误 | 0 | 0 MS | 260 KB | 347 | 2022-12-10 10:22:48 |
using namespace std; int main() { int a[10010],n,ma=0; int dp[10010]; cin>>n; for(int i=1;i<=n;i++) { cin>>n; } for(int i=1;i<=n;i++) { dp[i]=1; for(int j=1;j<i;j++) { if(a[i]>a[j]) { dp[i]=max(dp[j]+1,dp[i]); } } ma=max(dp[i],ma); } cout<<ma; return 0; }
10
4 5 7 1 9 3 10 6 8 2
1
5
exit code: 0, checker exit code: 0
10
3 1 5 6 2 7 8 9 10 4
1
7
exit code: 0, checker exit code: 0
10
8 1 6 10 5 4 7 3 2 9
1
4
exit code: 0, checker exit code: 0
10
10 4 3 5 2 8 7 9 1 6
1
4
exit code: 0, checker exit code: 0
10
3 7 4 5 9 2 1 8 10 6
1
5
exit code: 0, checker exit code: 0
2434
909 55 1631 1781 647 1418 2240 1923 596 359 2020 2015 21 1482 669 351 933 1969 415 1893 2307 1832 2302 1862 2168 1902 1432 911 1591 423 991 530 1692 2434 2141 1425 1861 1858 1118 123 1342 1583 1...
1
90
exit code: 0, checker exit code: 0
3783
1928 1341 842 1833 635 3291 2652 2907 1804 3085 2951 1885 3401 3223 1154 1252 3324 2928 2227 3589 1835 906 977 1002 2401 1147 3086 3102 3360 2641 1855 3698 3780 3574 3776 2677 2423 3598 3200 191...
1
120
exit code: 0, checker exit code: 0
6315
5205 3304 185 3478 665 143 4200 2464 5257 4144 6079 4895 349 168 1394 2815 4290 1464 5229 2505 796 686 2397 3012 864 733 2856 2104 5570 2582 4001 4606 3953 5877 294 4260 801 132 3364 1413 3894 5...
1
153
exit code: 0, checker exit code: 0
8201
3556 5645 4030 2905 774 3728 7699 6764 93 2833 3789 3099 7393 2179 883 4208 2535 3870 4744 6636 3803 3183 1316 5046 5583 8041 1942 305 7335 5425 7903 3001 7519 7906 6671 40 915 381 4221 687 576 ...
1
178
exit code: 0, checker exit code: 0
10000
6871 9323 8642 1496 373 4356 7716 6636 8317 2307 2725 9456 7932 96 4093 9995 3072 8949 3406 7928 5208 9346 1992 7353 3387 1410 3449 3022 8348 2813 6121 4535 5325 8752 7942 6054 9842 1594 1979 3...
1
196
exit code: 0, checker exit code: 0