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;
#define ff first
#define ss second
#define pii pair<int, int>
#define all(v) (v).begin(), (v).end()
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<pii> dp[n];
for (int i = 0; i < n; i++) {
ll sm = 0;
vector<pii> v;
for (int j = i; j >= 0; j--) {
sm += a[j];
if (!j) v.push_back({sm, 1});
else if (dp[j - 1][0].ff <= sm) v.push_back({sm, (*--upper_bound(all(dp[j - 1]), (pii){sm, INT_MAX})).ss + 1});
}
sort(v.begin(), v.end());
int mx = 0;
for (auto j : v) {
mx = max(mx, j.ss);
dp[i].push_back({j.ff, mx});
}
}
cout << dp[n - 1].back().ss;
}
# | 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... |