# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
482584 | 2021-10-25T17:00:50 Z | Hazem | Global Warming (CEOI18_glo) | C++14 | 2000 ms | 2736 KB |
#include <bits/stdc++.h> #define LL long long using namespace std; const int N = 2e5+1; const LL MOD = 1e9+7; int a[N],dp[N]; int n,k; int calc(){ int ret = 0; for(int i=1;i<=n;i++){ int mx = 0; for(int j=i-1;j>=1;j--) if(a[i]>a[j])mx = max(mx,dp[j]); dp[i] = mx+1; ret = max(ret,dp[i]); } return ret; } void op(int l,int r,int x){ for(int i=l;i<=r;i++) a[i] += x; } int main(){ scanf("%d%d",&n,&k); for(int i=1;i<=n;i++) scanf("%d",&a[i]); int ans = calc(); // for(int i=1;i<=n;i++){ // for(int j=-k;j<=k;j++){ // op(1,i,j); // ans = max(ans,calc()); // op(1,i,-j); // op(i,n,j); // ans = max(ans,calc()); // op(i,n,-j); // } // } printf("%d\n",ans); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 2084 ms | 2736 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 2081 ms | 900 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 2097 ms | 1348 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |