Submission #3238350

---

Source Code Expand

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

#define rep(i,j,n) for(int i=(j);i<(n);i++)
#define all(i) i.begin(),i.end()
#define rall(i) i.rbegin(),i.rend()
#define INF 1e9
#define LINF 1e18
const int mod = 1e9+7;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef pair<int, int> pi;
typedef long long i64;

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);

  int n;
  cin >> n;
  vi a(n);
  rep(i, 0, n) cin >> a[i];

  int ans = -INF;
  rep(i, 0, n) {
    int MAX = -INF;
    int res = -INF;
    rep(j, 0, n) {
      if(i == j) continue;
      int s = min(i, j), t = max(i, j);

      int sum1 = 0, sum2 = 0;
      rep(k, s, t + 1) {
        if((k - s) % 2) sum1 += a[k];
        else sum2 += a[k];
      }
      
      if(MAX < sum1) {
        MAX = sum1;
        res = sum2;
      }
    }
    ans = max(ans, res);
  }
  cout << ans << endl;
}

Submission Info

Judge Result