- 上升子序列
什么鬼,WA
- 2024-7-20 22:50:34 @
什么鬼,我的代码好像没有问题,但是WA了
#include <iostream>
#include <algorithm>
using namespace std;
int dp[1000001];
int a[1000001];
int main() {
int n;
cin >> n;
for(int i = 1;i<=n;i++) {
cin >> a[i];
}
for(int i = 1;i<=n;i++) {
if(a[i] >= a[i-1]) {
dp[i] = dp[i-1] + 1;
}else {
dp[i] = 1;
}
}
sort(dp+1,dp+n+1);
cout << dp[n];
return 0;
}
0 comments
No comments so far...
Information
- ID
- 876
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 10
- Tags
- # Submissions
- 3
- Accepted
- 0
- Uploaded By