Submission #1172031

#TimeUsernameProblemLanguageResultExecution timeMemory
1172031AtabayRajabliBigger segments (IZhO19_segments)C++20
13 / 100
21 ms328 KiB
#include <bits/stdc++.h> #define int long long #define all(v) v.begin(), v.end() using namespace std; const int sz = 3e3 + 1, inf = 1e18; int n, a[sz], dp[sz][sz]; signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n; for(int i = 0; i < n; i++) { cin >> a[i]; } int ans = 0; for(int bt = 0; bt < (1 << n); bt++) { int prv = 0, cnt = 0; for(int i = 0; i < n && cnt >= 0; i++) { int x = !!((1 << i) & bt); int j = i + 1, sm = a[i]; while(j < n && !!((1 << j) & bt) == x) { sm += a[j]; j++; } if(sm >= prv) { prv = sm; cnt++; } else cnt = -1; i = j - 1; } ans = max(ans, cnt); } 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...