Submission #1778706

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define DEBUG(x) cerr << #x << ": " << x << endl;
#define ll long long

int main() {
   int n;
   cin >> n;
   vector<int> v(n);
   for (int i = 0; i < n; i++) {
       cin >> v[i];
   }

   //高橋君がMax取れそうな場所検索
   int tMax = -1;
   int tPos = -1;
   for (int i = 0; i < n-1; i++) {
      // 奇数ならtrue, 偶数ならfalse
      int sum = 0;
      bool start = (i & 1) ? true : false;
      for (int j = i+1; j < n; j++) {
        //   printf("(%d, %d)\n", i, j);
        bool pos = (j & 1) ? true : false;
        if (start == pos) {
            sum += v[j];
        }
      }
      if (sum > tMax) {
        tPos = i;
        tMax = sum;
      }
   }

   //青木君がMax取れそうな場所検索
   int aMax = -1;
   int aPos = -1;
   for (int i = 0; i < n; i++) {
       if (i == tPos) continue;
       int start = min(tPos, i);
       int end = max(tPos, i);
       bool a = (i & 1) ? true : false;
       int sum = 0;
       for (int j = start; j < end; j++) {
           bool b = (i & 1) ? true : false;
           if (a == b) {
               sum += v[j];
           }
       }
       if (sum > aMax) {
           aPos = i;
           aMax = sum;
       }
   }

   int size = abs(aPos - tPos) + 1;
   vector<int> T(size);
   int start = min(aPos, tPos);
   int end = max(aPos, tPos);
   for (int i = start; i < end; i++) {
    T[i] = v[i];
   }

   int ans = 0;
   for (int i = 0; i < size; i++) {
       if ( (i+1) % 2 == 0 ) {
        ans += T[i];
       }
   }

   cout << ans << endl;

   return 0;
}

Submission Info

Judge Result