# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
173558 | Just_Solve_The_Problem | Bigger segments (IZhO19_segments) | C++11 | 146 ms | 10372 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];
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++) {
ind[i] = max(ind[i], ind[i - 1]);
dp[i] = dp[ind[i]] + 1;
int l = i;
int r = n + 1;
ll X = pref[i] * 2 - pref[ind[i]];
while (r - l > 1) {
int mid = (r + l) >> 1;
if (X <= pref[mid]) {
r = mid;
} else {
l = mid;
}
}
ind[r] = i;
}
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... |