This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXE = 1e9+5;
int N, dapat;
ll data[500005],
total = 0,
ans = MAXE,
sliding = 0,
setengah;
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> N;
dapat = (N+1)/2;
for(int i=0;i<N;i++){
cin >> data[i];
total += data[i];
}
setengah = total/2;
for(int i=0;i<dapat;i++) sliding += data[i];
if(sliding > setengah){
ans = min(sliding, ans);
}
//cout << sliding << endl;
for(int i=1;i<N;i++){
int right = (dapat+i-1)%N;
sliding = sliding-data[i-1]+data[right];
if(sliding > setengah){
ans = min(sliding, ans);
}
// cout << sliding << endl;
}
cout << ans << endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |