Submission #1114353

#TimeUsernameProblemLanguageResultExecution timeMemory
1114353vjudge1Bigger segments (IZhO19_segments)C++17
0 / 100
1 ms336 KiB
#include <bits/stdc++.h> using namespace std; #define int long long signed main() { int n; cin >> n; vector<int> a(n + 1), pref(n + 1); for (int i = 1; i<= n; i++){ cin >> a[i]; pref[i] = pref[i - 1] + a[i]; } vector<vector<int>> dp(n + 1, vector<int> (n + 1, 1e18)); dp[0][0] = 0; for (int i = 1; i <= n; i++){ for (int j = 0; j < i; j++){ int ini = 0, fin = i; while(ini < fin){ int m = (ini + fin) / 2; if (pref[i] >= dp[m][j] + pref[m]){ fin = m; }else ini = m + 1; } int suma = pref[i] - pref[ini]; if (suma >= dp[ini][j]){ dp[i][j + 1] = min(dp[i][j + 1], suma); } } } int ans = 0; for (int i = 1; i <= n; i++){ if (dp[n][i] != 1e18) ans = max(ans, i); } cout << ans << endl; }
#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...