Submission #489992

#TimeUsernameProblemLanguageResultExecution timeMemory
489992hoanghq2004Bigger segments (IZhO19_segments)C++14
13 / 100
73 ms98572 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...