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;
#ifdef Nero
#include "Deb.h"
#else
#define deb(...)
#endif
const int N = 5e5 + 5;
int a[N], f[N];
long long pref[N];
pair<int, long long> dp[N];
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
pref[i] = pref[i - 1] + a[i];
}
dp[1] = {1, a[1]};
f[1] = 1;
for (int i = 2; i <= n; ++i) {
bool c = false;
for (int j = 0; j <= i - 1; ++j) {
if (dp[j].second <= pref[i] - pref[j]) {
c = true;
dp[i].first = dp[j].first + 1;
dp[i].second = pref[i] - pref[j];
}
}
if (!c) {
dp[i] = dp[i - 1];
dp[i].second += a[i];
}
}
cout << dp[n].first << '\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... |