제출 #1225119

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1225119		crazy0215	Hacker (BOI15_hac)	C++20	0 / 100	0 ms	328 KiB

hac

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define show(x) cout << #x << " " << x << "\n";
#define showds(x) cout << #x << " "; for(auto y : x) cout << y << " "; cout << "\n";
typedef pair<int, int> ii;

bool cmp(pair<int, ii> a, pair<int, ii> b) {
	//if (a.fi==b.fi) return a.se<b.se;
	return a.fi>b.fi;
}

signed main() {
    ios_base::sync_with_stdio(false); cin.tie(0);
    int n; cin >> n;
    int a[n+n/2-1], ans=0, m=0;
    pair<int, ii> b[n];
    for (int i=0; i<n; i++) {
		cin >> a[i];
		ans+=a[i];
		if (i<n/2) m+=a[i];
	}
	b[0].fi=m, b[0].se.fi=0, b[0].se.se=n/2-1;
	for (int i=n; i<n+n/2-1; i++) a[i]=a[i%n];
	for (int i=n/2, j=0; j<n-1; i++, j++) {
        m+=-a[j]+a[i], b[j+1].fi=m, b[j+1].se.fi=j+1, b[j+1].se.se=i%n;
    }
    sort(b, b+n, cmp);
    int ct=n/2;
    bool v=false;
	for (int i=1; i<n; i++) {
        if (b[0].se.fi<=b[0].se.se) {
            v=true;
            if (b[i].se.fi<=b[i].se.se) {
                b[0].se.fi=max(b[0].se.fi, b[i].se.fi);
                b[0].se.se=min(b[0].se.se, b[i].se.se);
                ct=b[0].se.se-b[0].se.fi+1;
            } else {
                if (b[i].se.se>=b[0].se.fi) b[i].se.fi-=n;
                else b[i].se.se+=n;
                b[0].se.fi=max(b[0].se.fi, b[i].se.fi);
                b[0].se.se=min(b[0].se.se, b[i].se.se);
                ct=b[0].se.se-b[0].se.fi+1;
                b[0].se.fi%=n, b[0].se.se%=n;
            }
        } else {
            if (b[i].se.se<=b[i].se.fi) {
                b[0].se.fi=max(b[0].se.fi, b[i].se.fi);
                b[0].se.se=min(b[0].se.se, b[i].se.se);
                ct=b[0].se.se-b[0].se.fi+1;
            } else {
                if (b[i].se.fi<=b[0].se.se) b[0].se.fi-=n;
                else b[0].se.se+=n;
                b[0].se.fi=max(b[0].se.fi, b[i].se.fi);
                b[0].se.se=min(b[0].se.se, b[i].se.se);
                ct=b[0].se.se-b[0].se.fi+1;
                b[0].se.fi%=n, b[0].se.se%=n;
            }
        }
        if (ct<=0) {
            cout << ans-b[i].fi;
            break;
        }
	}
    return 0;
}

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