# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
409616 | 2021-05-21T08:02:30 Z | iulia13 | Hacker (BOI15_hac) | C++14 | 460 ms | 21988 KB |
#include <iostream> #include <set> using namespace std; const int N = 5e5 + 5; int v[3 * N]; int sum[2 * N]; struct ura{ int x, id; }; set <pair<int, int>> s; int main() { int n, j, cnt = n, i; cin >> n; for (i = 1; i <= n; i++) cin >> v[i]; for (j = 1; j < 3; j++) for (i = 1; i <= n; i++) v[++cnt] = v[i]; int st = 1, dr = (n + 1) / 2; for (i = st; i <= dr; i++) sum[1] += v[i]; while (st <= 2 * n) { sum[st + 1] = sum[st]; sum[st + 1] -= v[st]; st++; dr++; sum[st] += v[dr]; } st = n - (n + 1) / 2 + 2; dr = n + 1; for (i = st; i <= dr; i++) s.insert({sum[i], i}); pair<int, int> ans = *(s.begin()); while (dr <= 2 * n) { s.erase({sum[st], st}); st++; dr++; s.insert({sum[dr], dr}); if (ans.first < (*(s.begin())).first) ans = *(s.begin()); } cout << ans.first; return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 204 KB | Output is correct |
2 | Incorrect | 1 ms | 204 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 204 KB | Output is correct |
2 | Incorrect | 1 ms | 204 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 204 KB | Output is correct |
2 | Correct | 1 ms | 332 KB | Output is correct |
3 | Correct | 4 ms | 460 KB | Output is correct |
4 | Correct | 55 ms | 3780 KB | Output is correct |
5 | Correct | 150 ms | 8772 KB | Output is correct |
6 | Correct | 201 ms | 11252 KB | Output is correct |
7 | Correct | 234 ms | 13340 KB | Output is correct |
8 | Correct | 460 ms | 21988 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 204 KB | Output is correct |
2 | Incorrect | 1 ms | 204 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |