제출 #311280

#제출 시각아이디문제언어결과실행 시간메모리
311280sofapudenHacker (BOI15_hac)C++14
20 / 100
502 ms13304 KiB
#include <bits/stdc++.h> using namespace std; int main(){ int n; cin >> n; vector<int> v(n), msa; for(auto &x : v)cin >> x; int cur = 0; for(int i = 0; i < (n+1)/2; ++i){ cur+=v[i]; } msa.push_back(cur); int tot = v[n-1]; for(int i = 0; i < n-1; ++i){ tot+=v[i]; cur-=v[i]; cur+=v[(i+((n+1)/2))%n]; msa.push_back(cur); } set<int> S; for(int i = 0; i < (n+1)/2; ++ i){ S.insert(msa[i]); } int ans = *S.begin(); for(int i = 0; i < n-1; ++i){ S.erase(msa[i]); S.insert(msa[(i+((n+1)/2))%n]); ans = max(ans,*S.begin()); } cout << ans << "\n"; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...