Submission #1330645

#TimeUsernameProblemLanguageResultExecution timeMemory
1330645boclobanchatHacker (BOI15_hac)C++20
40 / 100
1095 ms836 KiB
#include<bits/stdc++.h>
using namespace std;
const int MAXN=5e5+5;
int pref[MAXN*2],A[MAXN];
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=(n+1)/2;i<n+(n+1)/2;i++)
	{
		int mn=1e9;
		for(int j=i-(n+1)/2+1;j<=i;j++) mn=min(mn,pref[j+(n+1)/2-1]-pref[j-1]);
		ans=max(ans,mn);
	} 
	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...