# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
489991 | hoanghq2004 | Bigger segments (IZhO19_segments) | C++14 | 1593 ms | 98544 KiB |
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 = l - 1;
// while (j <= )
for (int i = l, j = l - 1; i <= n; ++i) {
for (int j = l - 1; j < i; ++j) {
if (f[j][l - 1] < 0) continue;
if (s[i] - s[j] >= s[j] - s[f[j][l - 1]]) f[i][l] = j;// cout << l << ' ' << i << ' ' << j << '\n';
}
}
}
int ans = 0;
for (int i = 1; i <= n; ++i) if (f[n][i] >= 0) ans = i;
cout << ans;
}
Compilation message (stderr)
# | 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... |