oj.uz

Submission #66188

# Submission time Handle Problem Language Result Execution time Memory
66188 2018-08-10T03:01:04 Z MatheusLealV Hacker (BOI15_hac) C++17
0 / 100
 3 ms 668 KB 
#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";
}

Subtask #1
0 / 20.0

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

Subtask #2
0 / 20.0

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

Subtask #3
0 / 20.0

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

Subtask #4
0 / 40.0

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