Submission #851518

#TimeUsernameProblemLanguageResultExecution timeMemory
851518NeroZeinBigger segments (IZhO19_segments)C++17
37 / 100
1549 ms9300 KiB
#include "bits/stdc++.h" using namespace std; const int N = 5e5 + 5; int a[N], f[N]; long long pref[N]; pair<int, long long> dp[N]; int main(){ ios::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; for (int i = 1; i <= n; ++i) { cin >> a[i]; pref[i] = pref[i - 1] + a[i]; } dp[1] = {1, a[1]}; f[1] = 1; for (int i = 2; i <= n; ++i) { for (int j = i - 1; j >= 0; --j) { if (dp[j].second <= pref[i] - pref[j]) { dp[i].first = dp[j].first + 1; dp[i].second = pref[i] - pref[j]; break; } } } cout << dp[n].first << '\n'; return 0; }
#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...