# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1006398 | 2024-06-24T00:54:45 Z | devariaota | Bigger segments (IZhO19_segments) | C++17 | 0 ms | 344 KB |
#include<bits/stdc++.h> #define ll long long using namespace std; ll dp[500005], pos[500005], pref[500005], a[500005]; int main() { ll n; scanf("%lld", &n); for(int i=1; i<=n; i++) { scanf("%lld", &a[i]); pref[i]=pref[i-1]+a[i]; } pref[n+1]=1e18; for(int i=1; i<=n; i++) { dp[i]=dp[pos[i]]+1; pos[i]=max(pos[i], pos[i-1]); ll pt=lower_bound(pref+1, pref+n+1, 2*pref[i]-pref[pos[i]])-pref; // printf("pos=%lld %lld %lld\n", pos[i], pt, dp[i]); pos[pt]=i; } printf("%lld\n", dp[n]); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |