# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
290793 | PeppaPig | Bigger segments (IZhO19_segments) | C++14 | 1 ms | 384 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define long long long
#define pii pair<long, long>
#define x first
#define y second
using namespace std;
const int N = 5e5 + 5;
int n, dp[N];
long A[N], pref[N];
int main() {
scanf("%d", &n);
for(int i = 1; i <= n; i++) {
scanf("%lld", A + i);
pref[i] = pref[i - 1] + A[i];
}
vector<pii> vec;
int ans = 0;
vec.emplace_back(0, 0);
for(int i = 1; i <= n; i++) {
int idx = -1;
long val = -1;
for(pii p : vec) if(p.x <= pref[i] && p.x > val)
val = p.x, idx = p.y;
dp[i] = dp[idx] + 1, vec.emplace_back(2ll * pref[i] - pref[idx], i);
ans = max(ans, dp[i]);
}
printf("%d\n", ans);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |