# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
153905 | 2019-09-17T12:30:34 Z | mhy908 | 도넛 (JOI14_ho_t3) | C++14 | 10 ms | 632 KB |
#include <bits/stdc++.h> #define F first #define S second #define pb push_back #define mp make_pair #define llinf 8987654321987654321 #define inf 1987654321 using namespace std; typedef long long LL; typedef pair<int, int> pii; typedef pair<LL, LL> pll; int n; LL arr[200010], maxx, ans; LL f(int stnum, int st, int fin) { if(st==fin)return arr[st]-arr[stnum]; LL mid=(st+fin)/2+1; LL l=arr[mid]-arr[stnum]; int next=lower_bound(arr+mid+1, arr+stnum+n, l+arr[mid])-arr; if(arr[stnum+n]-arr[next]>=l&&next!=stnum+n)return f(stnum, mid, fin); return f(stnum, st, mid-1); } int main() { scanf("%d", &n); for(int i=1; i<=n; i++){ LL temp; scanf("%lld", &temp); arr[i]=arr[i-1]+temp; } maxx=arr[n]; for(int i=1; i<=n; i++){ arr[i+n]=arr[i]+maxx; } for(int i=0; i<n; i++){ ans=max(ans, f(i, i+1, i+n-1)); } printf("%lld", ans); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
4 | Correct | 2 ms | 376 KB | Output is correct |
5 | Correct | 2 ms | 252 KB | Output is correct |
6 | Correct | 2 ms | 256 KB | Output is correct |
7 | Correct | 2 ms | 256 KB | Output is correct |
8 | Correct | 2 ms | 376 KB | Output is correct |
9 | Correct | 2 ms | 256 KB | Output is correct |
10 | Correct | 2 ms | 376 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
4 | Correct | 2 ms | 376 KB | Output is correct |
5 | Correct | 2 ms | 252 KB | Output is correct |
6 | Correct | 2 ms | 256 KB | Output is correct |
7 | Correct | 2 ms | 256 KB | Output is correct |
8 | Correct | 2 ms | 376 KB | Output is correct |
9 | Correct | 2 ms | 256 KB | Output is correct |
10 | Correct | 2 ms | 376 KB | Output is correct |
11 | Correct | 2 ms | 256 KB | Output is correct |
12 | Correct | 2 ms | 376 KB | Output is correct |
13 | Correct | 2 ms | 376 KB | Output is correct |
14 | Correct | 3 ms | 348 KB | Output is correct |
15 | Correct | 2 ms | 256 KB | Output is correct |
16 | Correct | 3 ms | 376 KB | Output is correct |
17 | Correct | 2 ms | 376 KB | Output is correct |
18 | Correct | 2 ms | 376 KB | Output is correct |
19 | Correct | 3 ms | 376 KB | Output is correct |
20 | Correct | 2 ms | 256 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
4 | Correct | 2 ms | 376 KB | Output is correct |
5 | Correct | 2 ms | 252 KB | Output is correct |
6 | Correct | 2 ms | 256 KB | Output is correct |
7 | Correct | 2 ms | 256 KB | Output is correct |
8 | Correct | 2 ms | 376 KB | Output is correct |
9 | Correct | 2 ms | 256 KB | Output is correct |
10 | Correct | 2 ms | 376 KB | Output is correct |
11 | Correct | 2 ms | 256 KB | Output is correct |
12 | Correct | 2 ms | 376 KB | Output is correct |
13 | Correct | 2 ms | 376 KB | Output is correct |
14 | Correct | 3 ms | 348 KB | Output is correct |
15 | Correct | 2 ms | 256 KB | Output is correct |
16 | Correct | 3 ms | 376 KB | Output is correct |
17 | Correct | 2 ms | 376 KB | Output is correct |
18 | Correct | 2 ms | 376 KB | Output is correct |
19 | Correct | 3 ms | 376 KB | Output is correct |
20 | Correct | 2 ms | 256 KB | Output is correct |
21 | Correct | 9 ms | 504 KB | Output is correct |
22 | Correct | 9 ms | 528 KB | Output is correct |
23 | Correct | 9 ms | 504 KB | Output is correct |
24 | Correct | 10 ms | 504 KB | Output is correct |
25 | Correct | 9 ms | 504 KB | Output is correct |
26 | Correct | 9 ms | 504 KB | Output is correct |
27 | Correct | 9 ms | 504 KB | Output is correct |
28 | Correct | 10 ms | 632 KB | Output is correct |
29 | Correct | 9 ms | 604 KB | Output is correct |
30 | Correct | 10 ms | 504 KB | Output is correct |
31 | Incorrect | 8 ms | 504 KB | Output isn't correct |
32 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
4 | Correct | 2 ms | 376 KB | Output is correct |
5 | Correct | 2 ms | 252 KB | Output is correct |
6 | Correct | 2 ms | 256 KB | Output is correct |
7 | Correct | 2 ms | 256 KB | Output is correct |
8 | Correct | 2 ms | 376 KB | Output is correct |
9 | Correct | 2 ms | 256 KB | Output is correct |
10 | Correct | 2 ms | 376 KB | Output is correct |
11 | Correct | 2 ms | 256 KB | Output is correct |
12 | Correct | 2 ms | 376 KB | Output is correct |
13 | Correct | 2 ms | 376 KB | Output is correct |
14 | Correct | 3 ms | 348 KB | Output is correct |
15 | Correct | 2 ms | 256 KB | Output is correct |
16 | Correct | 3 ms | 376 KB | Output is correct |
17 | Correct | 2 ms | 376 KB | Output is correct |
18 | Correct | 2 ms | 376 KB | Output is correct |
19 | Correct | 3 ms | 376 KB | Output is correct |
20 | Correct | 2 ms | 256 KB | Output is correct |
21 | Correct | 9 ms | 504 KB | Output is correct |
22 | Correct | 9 ms | 528 KB | Output is correct |
23 | Correct | 9 ms | 504 KB | Output is correct |
24 | Correct | 10 ms | 504 KB | Output is correct |
25 | Correct | 9 ms | 504 KB | Output is correct |
26 | Correct | 9 ms | 504 KB | Output is correct |
27 | Correct | 9 ms | 504 KB | Output is correct |
28 | Correct | 10 ms | 632 KB | Output is correct |
29 | Correct | 9 ms | 604 KB | Output is correct |
30 | Correct | 10 ms | 504 KB | Output is correct |
31 | Incorrect | 8 ms | 504 KB | Output isn't correct |
32 | Halted | 0 ms | 0 KB | - |