# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
101223 | 2019-03-17T18:24:42 Z | Leonardo_Paes | Hacker (BOI15_hac) | C++11 | 0 ms | 0 KB |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e5+10; int vet[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]; } for(int i=1; i<=k; i++){ int u=i, x=1, sum=0; while(x<=k){ac sum+=vet[i]; u--; x++; if(u==0)u=n; } resp=min(resp,sum); } cout << resp << endl; }