제출 #101226

#제출 시각아이디문제언어결과실행 시간메모리
101226Leonardo_PaesHacker (BOI15_hac)C++11
20 / 100
138 ms5544 KiB
#include <bits/stdc++.h> using namespace std; const int MAXN = 5e5+10; int vet[MAXN], pref[MAXN]; int main(){ int n, k, resp=0x3f3f3f3f; cin >> n; k = ceil((double)n/2); for(int i=1; i<=n; i++){ cin >> vet[i]; pref[i]=vet[i]+pref[i-1]; } for(int i=1; i<=k; i++){ int sum=0; sum+= pref[i]; sum+= pref[n] - pref[n-(k-i)]; resp=min(resp,sum); } cout << resp << 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...