Submission #1266092

#TimeUsernameProblemLanguageResultExecution timeMemory
1266092rayan_bdBigger segments (IZhO19_segments)C++20
0 / 100
0 ms324 KiB
#include <bits/stdc++.h> using namespace std; #define int long long signed main(){ ios_base::sync_with_stdio(0); cin.tie(nullptr); cout.tie(nullptr); int n; cin >> n; vector<int> a(n + 1), pref(n + 1, 0); for(int i = 1; i <= n; ++i){ cin >> a[i]; pref[i] = pref[i - 1] + a[i]; } auto query = [&](int l, int r){ return pref[r] - pref[l - 1]; }; int prev = a[1], ans = 1, idx = 2; while(idx <= n){ int st = idx, en = n, best = -1; while(st <= en){ int mid = st + (en - st) / 2; if(query(idx, mid) >= prev){ best = mid; en = mid - 1; }else{ st = mid + 1; } } if(best == -1) break; else ++ans; prev = query(idx, best); idx = best + 1; } cout << ans << "\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...