제출 #545978

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
545978		OttoTheDino	Hacker (BOI15_hac)	C++17	20 / 100	421 ms	18108 KiB

hac

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

#define rep(i,s,e)                  for (int i = s; i <= e; ++i)
#define rrep(i,s,e)                 for (int i = s; i >= e; --i)
#define pb                          push_back
#define pf                          push_front
#define fi                          first
#define se                          second
#define all(a)                      a.begin(), a.end()
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    int n; cin >> n;
    int w[n], k = (n+1)/2, s = 0;
    rep (i,0,n-1) cin >> w[i];
    rep (i,0,k-1) s += w[i];
    vi segs;
    rep (i,0,n-1) {
        segs.pb(s);
        s -= w[i];
        s += w[(i+k)%n];
    }
    multiset<int> st;
    rep (i,0,k-1) st.insert(segs[i]);
    int ans = 0;
    rep (i,0,n-1) {
        ans = max(ans, *st.begin());
        st.erase(segs[i]);
        st.insert(segs[(i+k)%n]);
    }
    cout << ans << "\n";

    return 0;
}

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