제출 #1330455

#제출 시각아이디문제언어결과실행 시간메모리
1330455boclobanchatHacker (BOI15_hac)C++20
0 / 100
1 ms344 KiB
#include<bits/stdc++.h>
using namespace std;
const int MAXN=5e5+5;
int pref[MAXN*2],A[MAXN*2];
deque<int> dq;
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin>>n;
    for(int i=1;i<=n;i++)
    {
    	cin>>pref[i];
    	pref[i+n]=pref[i];
	}
	for(int i=1;i<=n*2;i++) pref[i]+=pref[i-1];
	int ans=0;
	for(int i=1;i<=n;i++) ans=max(ans,min(pref[i+(n+1)/2-1]-pref[i-1],pref[i+n]-pref[i+n-(n+1)/2]));
	cout<<ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...