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 int int64_t
using namespace std;
const int maxn = 5e5 + 10;
typedef long long ll;
int dp[maxn], bb[maxn];
int n, v[maxn], pref[maxn];
int32_t main() {
ios::sync_with_stdio(false), cin.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> v[i];
pref[i] = pref[i-1] + v[i];
}
for (int i = 1; i <= n; i++) {
bb[i] = max(bb[i], bb[i-1]);
dp[i] = dp[ bb[i] ] + 1;
int soma = pref[i] - pref[bb[i]];
int ini = i+1, fim = n, meio, best=0;
while (ini <= fim) {
meio = (ini + fim) >> 1;
if (pref[meio] - pref[i] >= soma) {
fim = meio-1;
best = meio;
}else
ini = meio+1;
}
bb[best] = i;
}
cout << dp[n] << "\n";
return 0;
}
# | 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... |