Submission #1114345

#TimeUsernameProblemLanguageResultExecution timeMemory
1114345vjudge1Bigger 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; int last = 0; for (int i = 1; i <= n; i++){ for (int k = 0; k < i; k++){ int suma = pref[i] - pref[k]; if (suma >= dp[k][last]){ dp[i][last + 1] = min(dp[i][last + 1], suma); } } if (dp[i][last + 1] != 1e18) last++; } /*for (int i = 0; i <= n; i++){ for (int j = 0; j <= n; j++){ cout << dp[i][j] << ' '; } cout << endl; }*/ cout << last << 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...