-
Notifications
You must be signed in to change notification settings - Fork 3
Expand file tree
/
Copy pathP1121.c
More file actions
55 lines (51 loc) · 1.34 KB
/
P1121.c
File metadata and controls
55 lines (51 loc) · 1.34 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
#include <stdio.h>
#include <stdlib.h>
#define N 200005
#define MIN 0x80000000
#define MAX 0x7fffffff
int sum[N];
int f[N];
int g[N];
static inline int min(int a, int b) { return a < b ? a : b; }
static inline int max(int a, int b) { return a > b ? a : b; }
int main() {
int n, i;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &sum[i]);
if (i) sum[i] += sum[i - 1];
}
int tmp = 0;
for (i = 0; i < n; i++) {
f[i] = sum[i] - tmp;
tmp = min(tmp, sum[i]);
g[i] = (i ? max(g[i - 1], f[i]) : f[i]);
}
int ans = MIN;
tmp = 0; // g[0] - sum[0];
for (i = 1; i < n; i++) {
f[i] = sum[i] + tmp;
tmp = max(tmp, g[i] - sum[i]);
g[i] = ((i > 1) ? max(g[i - 1], f[i]) : f[i]);
ans = max(ans, g[i]);
}
tmp = 0;
for (i = 1; i < n - 1; i++)
sum[i] -= sum[0];
for (i = 1; i < n - 1; i++) {
f[i] = sum[i] - tmp;
tmp = max(tmp, sum[i]);
g[i] = ((i > 1) ? min(g[i - 1], f[i]) : f[i]);
}
int minAns = MAX;
tmp = 0; // g[0] - sum[0]
for (i = 2; i < n - 1; i++) {
f[i] = sum[i] + tmp;
tmp = min(tmp, g[i] - sum[i]);
g[i] = ((i > 2) ? min(g[i - 1], f[i]) : f[i]);
minAns = min(minAns, g[i]);
}
ans = max(ans, sum[n - 1] - minAns);
printf("%d", ans);
exit(0);
}