답안 #31088

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
31088	2017-08-08T03:21:17 Z	nibnalin	Hacker (BOI15_hac)	C++14	100 / 100	693 ms	17676 KB

hac

#include <iostream>
#include <cstdio>
#include <vector>
#include <set>
using namespace std;

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

int n, A[maxn], v[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;
	for(int i = 0;i < sz;i++) v[0] += A[i];
	
	for(int i = 1;i < n;i++)
	{
		v[i] = v[i-1]+A[mod(i+sz-1)]-A[i-1];
	}
	
	set<pair<int, int>> S;

	for(int i = 0;i < sz;i++) S.insert({v[mod(0-i)], mod(0-i)});

	int res = S.begin()->first;
	for(int i = 0;i < n;i++)
	{
		S.erase({v[mod(i-sz)], mod(i-sz)}), S.insert({v[i], i});
		res = max(res, S.begin()->first);
	}
	printf("%d\n", res);
}

Compilation message

hac.cpp: In function 'int main()':
hac.cpp:15:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
                 ^
hac.cpp:16: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

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	5928 KB	Output is correct
2	Correct	0 ms	5928 KB	Output is correct
3	Correct	0 ms	5928 KB	Output is correct
4	Correct	0 ms	5928 KB	Output is correct
5	Correct	0 ms	5928 KB	Output is correct
6	Correct	0 ms	5928 KB	Output is correct
7	Correct	0 ms	5928 KB	Output is correct
8	Correct	0 ms	5928 KB	Output is correct
9	Correct	0 ms	5928 KB	Output is correct
10	Correct	0 ms	5928 KB	Output is correct
11	Correct	0 ms	5928 KB	Output is correct
12	Correct	0 ms	5928 KB	Output is correct
13	Correct	0 ms	5928 KB	Output is correct
14	Correct	0 ms	5928 KB	Output is correct
15	Correct	0 ms	5928 KB	Output is correct
16	Correct	0 ms	5928 KB	Output is correct
17	Correct	0 ms	5928 KB	Output is correct
18	Correct	0 ms	5928 KB	Output is correct

Subtask #2

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	5928 KB	Output is correct
2	Correct	0 ms	5928 KB	Output is correct
3	Correct	0 ms	5928 KB	Output is correct
4	Correct	0 ms	5928 KB	Output is correct
5	Correct	0 ms	5928 KB	Output is correct
6	Correct	0 ms	5928 KB	Output is correct
7	Correct	0 ms	5928 KB	Output is correct
8	Correct	0 ms	5928 KB	Output is correct
9	Correct	0 ms	5928 KB	Output is correct
10	Correct	0 ms	5928 KB	Output is correct
11	Correct	0 ms	5928 KB	Output is correct
12	Correct	0 ms	5928 KB	Output is correct
13	Correct	0 ms	5928 KB	Output is correct
14	Correct	0 ms	5928 KB	Output is correct
15	Correct	0 ms	5928 KB	Output is correct
16	Correct	0 ms	5928 KB	Output is correct
17	Correct	0 ms	5928 KB	Output is correct
18	Correct	0 ms	5928 KB	Output is correct
19	Correct	0 ms	5928 KB	Output is correct
20	Correct	0 ms	5928 KB	Output is correct
21	Correct	0 ms	5928 KB	Output is correct
22	Correct	0 ms	6060 KB	Output is correct
23	Correct	3 ms	6060 KB	Output is correct
24	Correct	0 ms	6060 KB	Output is correct
25	Correct	3 ms	6060 KB	Output is correct
26	Correct	3 ms	6060 KB	Output is correct
27	Correct	0 ms	5928 KB	Output is correct
28	Correct	0 ms	5928 KB	Output is correct
29	Correct	0 ms	5928 KB	Output is correct
30	Correct	0 ms	6060 KB	Output is correct
31	Correct	0 ms	6060 KB	Output is correct

Subtask #3

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	5928 KB	Output is correct
2	Correct	0 ms	5928 KB	Output is correct
3	Correct	3 ms	6060 KB	Output is correct
4	Correct	59 ms	7776 KB	Output is correct
5	Correct	203 ms	10680 KB	Output is correct
6	Correct	276 ms	11868 KB	Output is correct
7	Correct	313 ms	12924 KB	Output is correct
8	Correct	689 ms	17676 KB	Output is correct

Subtask #4

40.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	5928 KB	Output is correct
2	Correct	0 ms	5928 KB	Output is correct
3	Correct	0 ms	5928 KB	Output is correct
4	Correct	0 ms	5928 KB	Output is correct
5	Correct	0 ms	5928 KB	Output is correct
6	Correct	0 ms	5928 KB	Output is correct
7	Correct	0 ms	5928 KB	Output is correct
8	Correct	0 ms	5928 KB	Output is correct
9	Correct	0 ms	5928 KB	Output is correct
10	Correct	0 ms	5928 KB	Output is correct
11	Correct	0 ms	5928 KB	Output is correct
12	Correct	0 ms	5928 KB	Output is correct
13	Correct	0 ms	5928 KB	Output is correct
14	Correct	0 ms	5928 KB	Output is correct
15	Correct	0 ms	5928 KB	Output is correct
16	Correct	0 ms	5928 KB	Output is correct
17	Correct	0 ms	5928 KB	Output is correct
18	Correct	0 ms	5928 KB	Output is correct
19	Correct	0 ms	5928 KB	Output is correct
20	Correct	0 ms	5928 KB	Output is correct
21	Correct	0 ms	5928 KB	Output is correct
22	Correct	0 ms	6060 KB	Output is correct
23	Correct	3 ms	6060 KB	Output is correct
24	Correct	0 ms	6060 KB	Output is correct
25	Correct	3 ms	6060 KB	Output is correct
26	Correct	3 ms	6060 KB	Output is correct
27	Correct	0 ms	5928 KB	Output is correct
28	Correct	0 ms	5928 KB	Output is correct
29	Correct	0 ms	5928 KB	Output is correct
30	Correct	0 ms	6060 KB	Output is correct
31	Correct	0 ms	6060 KB	Output is correct
32	Correct	0 ms	5928 KB	Output is correct
33	Correct	0 ms	5928 KB	Output is correct
34	Correct	3 ms	6060 KB	Output is correct
35	Correct	59 ms	7776 KB	Output is correct
36	Correct	203 ms	10680 KB	Output is correct
37	Correct	276 ms	11868 KB	Output is correct
38	Correct	313 ms	12924 KB	Output is correct
39	Correct	689 ms	17676 KB	Output is correct
40	Correct	6 ms	6192 KB	Output is correct
41	Correct	13 ms	6456 KB	Output is correct
42	Correct	16 ms	6588 KB	Output is correct
43	Correct	216 ms	10680 KB	Output is correct
44	Correct	649 ms	17676 KB	Output is correct
45	Correct	69 ms	8304 KB	Output is correct
46	Correct	299 ms	12924 KB	Output is correct
47	Correct	693 ms	17676 KB	Output is correct
48	Correct	393 ms	17676 KB	Output is correct
49	Correct	376 ms	17676 KB	Output is correct
50	Correct	346 ms	17676 KB	Output is correct