| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 111798 | 毛泓博(做题专用,大号Fess) | 求最长不下降序列 | C++ | Wrong Answer | 0 | 73 MS | 328 KB | 314 | 2023-11-25 08:10:21 |
#include<bits/stdc++.h> using namespace std; int n,a[10000],dp[10000],ans; int main() { cin>>n; for(int i=1;i<=n;i++) cin>>a[i],dp[i]=1; for(int i=1;i<=n;i++) { int t=0; for(int j=1;j<i;j++) if(a[j]<a[i]&&dp[j]>t) t=dp[j]; dp[i]=t+1; if(ans<dp[i]) ans=dp[i]; } cout<<ans; return 0; }