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>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define N 2000001
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll INF = 1e18, MOD = 1e9 + 7, MOD2 = 1e6 + 3;
ll d_m[N], d[N], p[N], a[N], n;
int main () {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
p[i] = a[i] + (i ? p[i-1] : 0);
}
memset (d_m, -1, sizeof (d_m));
for (int i = 0; i < n; i++) {
if (i) d_m[i] = max (d_m[i], d_m[i-1]);
d[i] = (d_m[i] >= 0 ? d[d_m[i]] : 0) + 1;
int l = i + 1, r = n;
while (l < r) {
int mid = (l + r) / 2;
if (p[i] - p[d_m[i]] <= p[mid] - p[i]) r = mid;
else l = mid + 1;
}
d_m[l] = max (d_m[l], (ll)i);
}
cout << d[n-1];
}
# | 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... |