Submission #49118

#TimeUsernameProblemLanguageResultExecution timeMemory
49118faishol27Hacker (BOI15_hac)C++14
0 / 100
2 ms488 KiB
#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 = 0, sliding = 0, selisih = MAXE; 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]; } for(int i=0;i<dapat;i++) sliding += data[i]; if(abs(total-2*sliding) < selisih){ ans = max(total-sliding, sliding); selisih = abs(total-2*sliding); } // cout << sliding << endl; for(int i=1;i<N;i++){ int right = (dapat+i-1)%N; sliding = sliding-data[i-1]+data[right]; if(abs(total-2*sliding) < selisih){ ans = max(total-sliding, sliding); selisih = abs(total-2*sliding); } // cout << sliding << endl; } cout << ans << endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...