제출 #770621

#제출 시각아이디문제언어결과실행 시간메모리
770621ttamxBigger segments (IZhO19_segments)C++14
0 / 100
1 ms212 KiB
#include<bits/stdc++.h> using namespace std; typedef long long ll; const int N=5e5+5; int n; ll a[N]; int main(){ cin.tie(nullptr)->sync_with_stdio(false); cin >> n; for(int i=1;i<=n;i++)cin >> a[i]; ll sum=a[1]; int ans=1; for(int i=2;i<=n;i++){ int j=i; ll res=0; while(j<=n&&res<sum){ res+=a[j]; j++; } int idx=i; while(res-sum>=2ll*a[idx]){ res-=a[idx]; sum+=a[idx]; idx++; } if(res>=sum)ans++; sum=res; i=j-1; } 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...