# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
171378 | donentseto | Bigger segments (IZhO19_segments) | C++14 | 124 ms | 13176 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>
using namespace std;
long long n, a [500005], b [500005];
int main (){
ios::sync_with_stdio (false);
cin.tie (0);
cin >> n;
for (int i = 1; i <= n; i ++){
cin >> a [i];
a [i] += a [i - 1];
}
for (int i = 1; i <= n; i ++){
b [i] = max (b [i - 1], b [i]);
long long x = a [i] - a [b [i]];
int idx = lower_bound (a, a + n + 1, a [i] + x) - a;
b [idx] = i;
}
int ans = 0;
for (int i = n; i > 0; i = b [i]) ans ++;
cout << ans << '\n';
}
# | 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... |