Submission #983882

#TimeUsernameProblemLanguageResultExecution timeMemory
983882LucaIlieHacker (BOI15_hac)C++17
0 / 100
1 ms2492 KiB
#include <bits/stdc++.h> using namespace std; const int MAX_N = 5e5; int v[MAX_N + 1], sp[MAX_N + 1]; int sum( int l, int r ) { return sp[r] - sp[l - 1]; } int main() { int n; cin >> n; for ( int i = 1; i <= n; i++ ) { cin >> v[i]; sp[i] = sp[i - 1] + v[i]; } int maxx = 0; for ( int i = 1; i <= n; i++ ) { int minn = 1e9; for ( int l = 0; l < (n + 1) / 2; l++ ) minn = min( minn, sum( i + l, (i + l + (n + 1) / 2 - 2 + n) % n + 1 ) ); maxx = max( maxx, minn ); } cout << maxx; 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...