Submission #1624348

---

Source Code Expand

#include <algorithm>
#include <iostream>
#include <vector>

int main(void) {
  int N;
  std::vector<int> a;

  std::cin >> N;
  a.reserve(N);
  for (int i = 0; i < N; ++i) {
    std::cin >> a[i];
  }

  int takahashi_score, aoki_score;
  int takahashi_score_max, aoki_score_max;
  int aoki_chose_max;
  takahashi_score_max = -9999999;
  for (int takahashi_chose = 0; takahashi_chose < N; ++takahashi_chose) {
    aoki_score_max = -9999999;
    for (int aoki_chose = 0; aoki_chose < N; ++aoki_chose) {
      if (takahashi_chose == aoki_chose) continue;
      aoki_score = 0;
      for (int i = std::min(takahashi_chose, aoki_chose) + 1;
           i <= std::max(takahashi_chose, aoki_chose);
           i += 2) {
        aoki_score += a[i];
      }
      if(aoki_score_max < aoki_score) {
        aoki_chose_max = aoki_chose;
        aoki_score_max = aoki_score;
      }
    }
    takahashi_score = 0;
    for (int i = std::min(takahashi_chose, aoki_chose_max);
         i <= std::max(takahashi_chose, aoki_chose_max);
         i += 2) {
      takahashi_score += a[i];
    }
    if (takahashi_score_max < takahashi_score) {
      takahashi_score_max = takahashi_score;
    }
  }
  std::cout << takahashi_score_max << std::endl;

  return 0;
}

Submission Info

Judge Result