Submission #723759

#TimeUsernameProblemLanguageResultExecution timeMemory
723759rshohruhHacker (BOI15_hac)C++14
40 / 100
661 ms262144 KiB
#include <iostream> #include <vector> #include <algorithm> using namespace std; int main() { #ifdef __local__ freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); #endif int n; cin >> n; vector<int> lis(n); for (int i = 0; i < n; i++) { cin >> lis[i]; } vector<vector<int>> sussies(n); int k = (n + 1) / 2; lis.insert(lis.end(), lis.begin(), lis.end()); for (int i = 0; i < n; i++) { int cur = 0; for (int j = 0; j < k; j++) { cur += lis[i+j]; } for (int j = 0; j < k; j++) { sussies[(i+j)%n].push_back(cur); } } int ans = 0; for (int i = 0; i < n; i++) ans = max(ans, *min_element(sussies[i].begin(), sussies[i].end())); cout << ans << endl; 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...