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>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
using namespace std;
const int Nmax = 5010;
int n;
long long s[Nmax];
int f[Nmax][Nmax];
int main() {
ios :: sync_with_stdio(0); cin.tie(0);
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> s[i];
s[i] += s[i - 1];
}
memset(f, -60, sizeof(f));
for (int i = 1; i <= n; ++i) f[i][1] = 0;
for (int l = 2; l <= n; ++l) {
int j = 0;
while (f[j][l - 1] < 0) ++j;
for (int i = l; i <= n; ++i) {
f[i][l] = f[i - 1][l];
while (j < i && s[i] - s[j] >= s[j] - s[f[j][l - 1]]) f[i][l] = j, ++j;
}
}
int ans = 0;
for (int i = 1; i <= n; ++i) if (f[n][i] >= 0) ans = i;
cout << ans;
}
# | 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... |