oj.uz

답안 #31087

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
31087 2017-08-08T03:00:39 Z nibnalin Hacker (BOI15_hac) C++14
0 / 100
 0 ms 3972 KB 
#include <iostream>
#include <cstdio>
#include <vector>
using namespace std;

const int maxn = int(5e5)+5, inf = int(1e9)+5;

int n, A[maxn];

inline int mod(int x) { return ((x%n)+n)%n; }

int main(void)
{
	scanf("%d", &n);
	for(int i = 0;i < n;i++) scanf("%d", &A[i]);
	int sz = n/2+n%2;
	int back = 0, front = 0;
	for(int i = 0;i < sz;i++) front += A[mod(i)], back += A[mod(0-i)];
	
	int res = min(front, back);
	for(int i = 1;i < n;i++)
	{
		front -= A[mod(i-1)];
		back -= A[mod(i-sz)];
		front += A[mod(i+sz-1)];
		back += A[mod(i)];
		res = max(res, min(front, back));
	}
	printf("%d\n", res);
}

Compilation message

hac.cpp: In function 'int main()':
hac.cpp:14:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
                 ^
hac.cpp:15:45: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i = 0;i < n;i++) scanf("%d", &A[i]);
                                             ^

Subtask #1
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 3972 KB Output is correct
2 Incorrect 0 ms 3972 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 3972 KB Output is correct
2 Incorrect 0 ms 3972 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 3972 KB Output is correct
2 Incorrect 0 ms 3972 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 3972 KB Output is correct
2 Incorrect 0 ms 3972 KB Output isn't correct
3 Halted 0 ms 0 KB -