# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
173475 | Just_Solve_The_Problem | Bigger segments (IZhO19_segments) | C++11 | 2 ms | 376 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 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];
}
for (int i = 1; i <= n; i++) {
dp[i] = dp[i - 1];
ind[i] = ind[i - 1];
mxx[i] = mxx[i - 1];
int l = 0;
for (int j = 0; j < i; j++) {
if (pref[i] >= mxx[j]) {
l = j;
}
}
dp[i] = dp[l] + 1;
ind[i] = l;
mxx[i] = max(mxx[i], pref[i] - pref[l]);
}
cout << dp[n];
}
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... |