Submission #66188

#TimeUsernameProblemLanguageResultExecution timeMemory
66188MatheusLealVHacker (BOI15_hac)C++17
0 / 100
3 ms668 KiB
#include <bits/stdc++.h>
#define N 200050
using namespace std;

int n, v[N], sum[N], k, ans[N][2], resp;

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

	cin>>n;

	k = (n + 1)/2;

	for(int i = 1; i <= n; i++)
	{
		cin>>v[i];

		v[i + n] = v[i];
	}

	for(int i = 1; i <= 2*n; i++) sum[i] = sum[i - 1] + v[i];

	for(int i = 1; i <= n; i++) ans[i][0] = sum[i + k - 1] - sum[i - 1];

	for(int i = n + 1; i <= 2*n; i++) ans[i - n][1] = sum[i] - sum[i - k];

	for(int i = 1; i <= n; i++) resp = max(resp, min(ans[i][0], ans[i][1]));

	cout<<resp<<"\n";
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...