Submission #798107

#TimeUsernameProblemLanguageResultExecution timeMemory
798107tch1cherinHacker (BOI15_hac)C++17
0 / 100
0 ms212 KiB
// Proof by AC
#include <bits/stdc++.h>
using namespace std;

int main() {
  int N;
  cin >> N;
  vector<int> A(N);
  for (int &v : A) {
    cin >> v;
  }
  for (int i = 0; i < N; i++) {
    A.push_back(A[i]);
  }
  vector<int> pref(2 * N);
  for (int i = 0; i < 2 * N - 1; i++) {
    pref[i + 1] = pref[i] + A[i];
  }
  vector<int> S;  
  for (int i = (N + 1) / 2; i < N + (N + 1) / 2; i++) {
    S.push_back(pref[i] - pref[i - (N + 1) / 2]);
  }
  sort(S.rbegin(), S.rend());
  cout << S[(N - 1) / 2] << "\n";
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...