제출 #723654

#제출 시각아이디문제언어결과실행 시간메모리
723654kas_sHacker (BOI15_hac)C++17
0 / 100
1083 ms944 KiB
#include <bits/stdc++.h> #pragma GCC optimize("Ofast") using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); int N; cin >> N; vector<int> a(N); long long s = 0; for (int &v: a) { cin >> v; s += v; } for (int i = 0; i < N; i++) a.push_back(a[i]); long long res = 0; for (int i = 0; i < N; i++) { int len = (N + 1) / 2; long long window = 0; for (int j = 0; j < len; j++) window += a[j]; long long curr = INT_MAX; for (int r = len; r < N + N; r++) { window += a[r]; window -= a[r-len]; if (r - len + 1 <= i + N && r >= i + N) { curr = min(curr, window); } } res = max(res, curr); } cout << res; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...