# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
173478 | 2020-01-04T08:47:48 Z | Just_Solve_The_Problem | Bigger segments (IZhO19_segments) | C++11 | 2 ms | 376 KB |
#include <bits/stdc++.h> #define ll long long using namespace std; const int N = (int)5e5 + 7; int n; int a[N], dp[N], ind[N]; ll pref[N], mxx[N]; main() { scanf("%d", &n); for (int i = 1; i <= n; i++) { scanf("%d", &a[i]); pref[i] = pref[i - 1] + a[i]; mxx[i] = pref[i]; } for (int i = 1; i <= n; i++) { dp[i] = dp[i - 1]; ind[i] = ind[i - 1]; int l = 0; for (int j = 0; j < i; j++) { if (pref[i] - pref[j] >= mxx[j]) { l = j; } } dp[i] = dp[l] + 1; ind[i] = l; mxx[i] = mxx[i - 1]; if (pref[i] - pref[l] <= mxx[i]) { mxx[i] = pref[i] - pref[l]; ind[i] = l; } } for (int i = 1; i <= n; i++) { // cout << dp[i] << ' ' << ind[i] << endl; } cout << dp[n]; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 376 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 376 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 376 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 376 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 376 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |