Submission #723753

#	Time	Username	Problem	Language	Result	Execution time	Memory
723753		rshohruh	Hacker (BOI15_hac)	C++14	40 / 100	667 ms	262144 KiB

hac

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

bool cmp(const vector<int>& a, const vector<int>& b) {
    return *min_element(a.begin(), a.end()) < *min_element(b.begin(), b.end());
}

int main() {
    #ifdef __local__
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif
    int n;
    cin >> n;
    vector<int> lis(n);
    for (int i = 0; i < n; i++) {
        cin >> lis[i];
    }
    vector<vector<int>> sussies(n);
    int k = (n + 1) / 2;
    lis.insert(lis.end(), lis.begin(), lis.end());
    for (int i = 0; i < n; i++) {
        int cur = 0;
        for (int j = 0; j < k; j++) {
            cur += lis[i+j];
        }
        for (int j = 0; j < k; j++) {
            sussies[(i+j)%n].push_back(cur);
        }
    }
    vector<int> mins;
    for (int i = 0; i < n; i++) {
        mins.push_back(*min_element(sussies[i].begin(), sussies[i].end()));
    }
    int ans = *max_element(mins.begin(), mins.end());
    cout << ans << endl;
    return 0;
}

• Subtask 1: 20 / 20
• Subtask 2: 20 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 40