# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
173465 | 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];
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] = 1;
ind[i] = 0;
int l = 0;
int r = i;
while (r - l > 1) {
int mid = (l + r) >> 1;
if (pref[mid] * 2 - pref[ind[mid]] <= pref[i]) {
l = mid;
} else {
r = mid;
}
}
dp[i] = dp[l] + 1;
ind[i] = l;
}
cerr << ind[4] << endl;
cout << dp[n];
}
/*
4
2 3 1 7
3
5
6 2 3 9 13
3
3
3 1 2
2
*/
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... |