Submission #1628151

---

Source Code Expand

#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define ll long long
#define MOD 1000000007
#define imfor(i, n) for(int i = 0; i < n; i++)
using namespace std;

int main() {
    int n;
    int a[60];
    cin >> n;
    imfor(i, n) {
        cin >> a[i];
    }
    int ans = -999999999;
    imfor(i, n) {
        int maxi;
        int maxj = -99999999;
        imfor(j, n) {
            if (i == j) {
                continue;
            }
            int tmpi = 0, tmpj = 0;
            if (i < j) {
                for (int k = i; k <= j; k += 2) {
                    tmpi += a[k];
                }
                for (int k = i + 1; k <= j; k += 2) {
                    tmpj += a[k];
                }
            }
            else {
                for (int k = j; k <= i; k += 2) {
                    tmpi += a[k];
                }
                for (int k = j + 1; k <= i; k += 2) {
                    tmpj += a[k];
                }
            }
            if (tmpj > maxj) {
                maxj = tmpj;
                maxi = tmpi;
            }
        }
        if (maxi > ans) {
            ans = maxi;
        }
    }
    cout << ans << endl;
}

Submission Info

Judge Result