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;
using ll = long long;
int main() {
ios::sync_with_stdio(false); cin.tie(nullptr);
int n;
cin >> n;
vector<int> a(n);
for (auto &i : a)
cin >> i;
vector<ll> p(n);
for (int i = 0; i < n; i++)
p[i] = (i ? p[i - 1] : 0) + a[i];
vector<ll> dp(n), v(n);
dp[0] = 1; v[0] = a[0];
for (int i = 1; i < n; i++) {
dp[i] = dp[i - 1]; v[i] = v[i - 1] + a[i];
for (int j = i - 1; j >= 0 && dp[i] <= dp[j] + 1; j--) {
if (v[j] <= p[i] - p[j]) {
v[i] = min((dp[i] == dp[j] + 1 ? v[i] : LLONG_MAX), p[i] - p[j]);
dp[i] = dp[j] + 1;
break;
}
}
}
cout << dp[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... |