# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
861434 | Halym2007 | Bigger segments (IZhO19_segments) | C++11 | 14 ms | 16220 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 = 5e5 + 5;
ll dp[N], p[N], a[N], val[N];
int main () {
freopen("input.txt", "r", stdin);
ll n;
cin >> n;
for (ll i = 1; i <= n; ++i) {
cin >> a[i];
p[i] = a[i] + p[i - 1];
}
for (ll i = 1; i <= n; ++i) {
ll l = 1;
ll r = i;
ll jog = 0;
while (l <= r) {
ll md = (l + r) / 2;
if (p[i] - p[md - 1] >= val[md - 1]) {
l = md + 1;
jog = md;
}
else r = md - 1;
}
// if (!jog)continue;
dp[i] = dp[jog - 1] + 1;
val[i] = p[i] - p[jog - 1];
}
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... |