# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
384659 | 2021-04-02T03:16:04 Z | zoooma13 | Hacker (BOI15_hac) | C++14 | 435 ms | 22344 KB |
#include <bits/stdc++.h> using namespace std; int main() { int n ,sum = 0; scanf("%d",&n); vector <int> a(n); for(int&i : a) scanf("%d",&i) ,sum += i; a.insert(a.end() ,a.begin() ,a.end()); vector <int> b(n); for(int i=0; i<n/2; i++) b[0] += a[i]; for(int i=1; i<n; i++) b[i] = b[i-1] - a[i-1] + a[i+n/2-1]; b.insert(b.end() ,b.begin() ,b.end()); multiset <int> ms; for(int i=0; i<n/2; i++) ms.insert(b[i]); int ans = sum - *ms.rbegin(); for(int i=0; i<n; i++){ ms.erase(ms.find(b[i])); ms.insert(b[i+n/2]); ans = max(ans ,sum - *ms.rbegin()); } printf("%d\n",ans); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 384 KB | Output is correct |
2 | Correct | 1 ms | 364 KB | Output is correct |
3 | Incorrect | 2 ms | 364 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 384 KB | Output is correct |
2 | Correct | 1 ms | 364 KB | Output is correct |
3 | Incorrect | 2 ms | 364 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 376 KB | Output is correct |
2 | Correct | 1 ms | 384 KB | Output is correct |
3 | Correct | 3 ms | 492 KB | Output is correct |
4 | Correct | 41 ms | 3504 KB | Output is correct |
5 | Correct | 121 ms | 8924 KB | Output is correct |
6 | Correct | 169 ms | 11160 KB | Output is correct |
7 | Correct | 212 ms | 13528 KB | Output is correct |
8 | Correct | 435 ms | 22344 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 384 KB | Output is correct |
2 | Correct | 1 ms | 364 KB | Output is correct |
3 | Incorrect | 2 ms | 364 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |