#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ar array
const int mxN=5e5;
int n, a[mxN], p[mxN+1];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int i=0; i<n; ++i)
cin >> a[i];
int ans=0;
for (int rep=0; rep<n; ++rep) {
for (int i=0; i<n; ++i)
p[i+1]=p[i]+a[i];
int mx=0;
for (int i=1; i<n; ++i) {
int cur=0;
for (int j=1; j+n/2-1<n; ++j) {
int j2=j+n/2-1;
if (i-j<j&&j2-i<n-j2)
cur=max(cur, p[j+n/2]-p[j]);
}
mx=max(mx, cur);
}
ans=max(ans, p[n]-mx);
rotate(a, a+1, a+n);
}
cout << ans;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
1 ms |
340 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
2 ms |
340 KB |
Output is correct |
6 |
Correct |
2 ms |
332 KB |
Output is correct |
7 |
Correct |
20 ms |
212 KB |
Output is correct |
8 |
Correct |
21 ms |
336 KB |
Output is correct |
9 |
Correct |
22 ms |
332 KB |
Output is correct |
10 |
Correct |
21 ms |
336 KB |
Output is correct |
11 |
Correct |
24 ms |
344 KB |
Output is correct |
12 |
Correct |
21 ms |
212 KB |
Output is correct |
13 |
Correct |
1 ms |
340 KB |
Output is correct |
14 |
Correct |
1 ms |
212 KB |
Output is correct |
15 |
Correct |
1 ms |
340 KB |
Output is correct |
16 |
Correct |
19 ms |
340 KB |
Output is correct |
17 |
Correct |
14 ms |
340 KB |
Output is correct |
18 |
Correct |
21 ms |
344 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
1 ms |
340 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
2 ms |
340 KB |
Output is correct |
6 |
Correct |
2 ms |
332 KB |
Output is correct |
7 |
Correct |
20 ms |
212 KB |
Output is correct |
8 |
Correct |
21 ms |
336 KB |
Output is correct |
9 |
Correct |
22 ms |
332 KB |
Output is correct |
10 |
Correct |
21 ms |
336 KB |
Output is correct |
11 |
Correct |
24 ms |
344 KB |
Output is correct |
12 |
Correct |
21 ms |
212 KB |
Output is correct |
13 |
Correct |
1 ms |
340 KB |
Output is correct |
14 |
Correct |
1 ms |
212 KB |
Output is correct |
15 |
Correct |
1 ms |
340 KB |
Output is correct |
16 |
Correct |
19 ms |
340 KB |
Output is correct |
17 |
Correct |
14 ms |
340 KB |
Output is correct |
18 |
Correct |
21 ms |
344 KB |
Output is correct |
19 |
Correct |
90 ms |
340 KB |
Output is correct |
20 |
Correct |
645 ms |
340 KB |
Output is correct |
21 |
Correct |
299 ms |
340 KB |
Output is correct |
22 |
Execution timed out |
1093 ms |
340 KB |
Time limit exceeded |
23 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
54 ms |
324 KB |
Output is correct |
3 |
Execution timed out |
1070 ms |
340 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
1 ms |
340 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
2 ms |
340 KB |
Output is correct |
6 |
Correct |
2 ms |
332 KB |
Output is correct |
7 |
Correct |
20 ms |
212 KB |
Output is correct |
8 |
Correct |
21 ms |
336 KB |
Output is correct |
9 |
Correct |
22 ms |
332 KB |
Output is correct |
10 |
Correct |
21 ms |
336 KB |
Output is correct |
11 |
Correct |
24 ms |
344 KB |
Output is correct |
12 |
Correct |
21 ms |
212 KB |
Output is correct |
13 |
Correct |
1 ms |
340 KB |
Output is correct |
14 |
Correct |
1 ms |
212 KB |
Output is correct |
15 |
Correct |
1 ms |
340 KB |
Output is correct |
16 |
Correct |
19 ms |
340 KB |
Output is correct |
17 |
Correct |
14 ms |
340 KB |
Output is correct |
18 |
Correct |
21 ms |
344 KB |
Output is correct |
19 |
Correct |
90 ms |
340 KB |
Output is correct |
20 |
Correct |
645 ms |
340 KB |
Output is correct |
21 |
Correct |
299 ms |
340 KB |
Output is correct |
22 |
Execution timed out |
1093 ms |
340 KB |
Time limit exceeded |
23 |
Halted |
0 ms |
0 KB |
- |