답안 #104610

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
104610 2019-04-08T10:48:41 Z alexpetrescu Hacker (BOI15_hac) C++14
100 / 100
105 ms 7800 KB
#include <cstdio>
#include <algorithm>

//FILE *fin = fopen("a.in", "r"), *fout = fopen("a.out", "w");
#define fin stdin
#define fout stdout

#define MAXN 500009

int v[2 * MAXN], dq[MAXN], sum[MAXN];

int main() {
    int n;
    fscanf(fin, "%d", &n);

    for (int i = 1; i <= n; i++)
        fscanf(fin, "%d", &v[i]);

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

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

    int st = 0, dr = 0, ans = 0;
    for (int i = 1; i <= 2 * n; i++) {
        if (st < dr && i - dq[st] == n - l)
            st++;
        while (st < dr && v[i] >= v[dq[dr - 1]])
            dr--;
        dq[dr++] = i;
        if (i >= n - l)
            ans = std::max(ans, sum[n] - v[dq[st]]);
    }

    fprintf(fout, "%d\n", ans);

    fclose(fin);
    fclose(fout);
    return 0;
}

Compilation message

hac.cpp: In function 'int main()':
hac.cpp:14:11: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     fscanf(fin, "%d", &n);
     ~~~~~~^~~~~~~~~~~~~~~
hac.cpp:17:15: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         fscanf(fin, "%d", &v[i]);
         ~~~~~~^~~~~~~~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 3 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 3 ms 384 KB Output is correct
23 Correct 3 ms 384 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 3 ms 384 KB Output is correct
26 Correct 3 ms 384 KB Output is correct
27 Correct 2 ms 256 KB Output is correct
28 Correct 2 ms 384 KB Output is correct
29 Correct 2 ms 384 KB Output is correct
30 Correct 3 ms 384 KB Output is correct
31 Correct 3 ms 384 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 16 ms 1272 KB Output is correct
5 Correct 29 ms 2808 KB Output is correct
6 Correct 44 ms 3520 KB Output is correct
7 Correct 50 ms 4004 KB Output is correct
8 Correct 80 ms 6264 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 3 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 3 ms 384 KB Output is correct
23 Correct 3 ms 384 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 3 ms 384 KB Output is correct
26 Correct 3 ms 384 KB Output is correct
27 Correct 2 ms 256 KB Output is correct
28 Correct 2 ms 384 KB Output is correct
29 Correct 2 ms 384 KB Output is correct
30 Correct 3 ms 384 KB Output is correct
31 Correct 3 ms 384 KB Output is correct
32 Correct 2 ms 256 KB Output is correct
33 Correct 2 ms 384 KB Output is correct
34 Correct 3 ms 384 KB Output is correct
35 Correct 16 ms 1272 KB Output is correct
36 Correct 29 ms 2808 KB Output is correct
37 Correct 44 ms 3520 KB Output is correct
38 Correct 50 ms 4004 KB Output is correct
39 Correct 80 ms 6264 KB Output is correct
40 Correct 4 ms 640 KB Output is correct
41 Correct 7 ms 640 KB Output is correct
42 Correct 7 ms 768 KB Output is correct
43 Correct 31 ms 2808 KB Output is correct
44 Correct 82 ms 6292 KB Output is correct
45 Correct 17 ms 1636 KB Output is correct
46 Correct 56 ms 3960 KB Output is correct
47 Correct 105 ms 6264 KB Output is correct
48 Correct 58 ms 6264 KB Output is correct
49 Correct 81 ms 7800 KB Output is correct
50 Correct 71 ms 7800 KB Output is correct