제출 #101224

#제출 시각아이디문제언어결과실행 시간메모리
101224Leonardo_PaesHacker (BOI15_hac)C++11
0 / 100
3 ms256 KiB
#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){
            sum+=vet[i];
            u--;
            x++;
            if(u==0)u=n;
        }
        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...