Submission #448723

#	Time	Username	Problem	Language	Result	Execution time	Memory
448723		SirCovidThe19th	Hacker (BOI15_hac)	C++14	0 / 100	1 ms	332 KiB

hac

#include <bits/stdc++.h>
using namespace std; 

int main(){
    int n; cin >> n; int k = ceil(n/2.0), A[2*n+1] = {}, ans = 0; multiset<int> s;
    for (int i = 1; i <= 2*n; i++) cin >> A[i], A[i+n] = A[i];
    for (int i = 1; i <= 2*n; i++) A[i] += A[i-1];
    for (int i = 1; i+k-1 <= 2*n; i++){
        s.insert(A[i+k-1]-A[i-1]);
        if (i >= k){
            ans = max(ans, *s.begin());
            s.erase(s.find(A[i]-A[i-k]));
        }
    }cout<<ans<<endl;
}
 

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