oj.uz

Submission #426149

# Submission time Handle Problem Language Result Execution time Memory
426149 2021-06-13T14:42:47 Z penguinhacker Hacker (BOI15_hac) C++14
0 / 100
 1 ms 332 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ar array

const int mxN=5e5;
int n, a[mxN], cur, s[mxN];

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n;
	for (int i=0; i<n; ++i)
		cin >> a[i];
	int m=(n+1)/2;
	for (int i=0; i<m; ++i)
		cur+=a[i];
	s[0]=cur;
	for (int i=1; i<m; ++i) {
		cur+=a[(i+m-1)%n]-a[i-1];
		s[i]=cur;
	}
	int ans=0;
	for (int i=0; i<n; ++i)
		ans=max(ans, min(s[i], s[(i+m-1)%n]));
	cout << ans;
	return 0;
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Incorrect 1 ms 332 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Incorrect 1 ms 332 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Incorrect 1 ms 332 KB Output isn't correct
3 Halted 0 ms 0 KB -