# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1107894 | alex_2008 | Bigger segments (IZhO19_segments) | C++14 | 0 ms | 0 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 <iostream>
#define ff first
#define ss second
typedef long long ll;
using namespace std;
const int N = 5e5 + 10;
ll pref[N];
pair <ll, ll> dp[N];
ll dpp[N];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> pref[i];
pref[i] += pref[i - 1];
}
dp[0] = { 0, 0 };
dpp[0] = 0;
for (int i = 1; i <= n; i++) {
int ind = upper_bound(dpp, dpp + i, pref[i]) - dpp - 1;
dp[i] = { dp[ind].first + 1, pref[i] - pref[ind] };
dpp[i] = dp[i].ss + pref[i];
}
cout << dp[n].first << "\n";
}