Submission #1644566

---

Source Code Expand

#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<stdio.h>
#include<cmath>
#include<vector>
#include<utility>
#include<stack>
#include<queue>

#define FOR(i, a, b) for(int i=(a);i<=(b);i++)
#define RFOR(i, a, b) for(int i=(a);i>=(b);i--)
#define MOD 1000000007

using namespace std;

int main(void) {
	int n;
	int a[51];
	int ah, th;
	int a_max = -10000000;
	int t_min = -10000000;
	int tp;
	bool flag = true;

	cin >> n;
	FOR(i, 1, n) {
		cin >> a[i];
	}
	FOR(i, 1, n) {
		a_max = -10000000;
		FOR(t, 1, n) {
			if (i == t) {
				continue;
			}
			ah = 0;
			th = 0;
			flag = true;
			if (i > t) {
				FOR(p, t, i) {
					if (flag == true) {
						th += a[p];
						flag = false;
					}
					else {
						ah += a[p];
						flag = true;
					}
				}
			}
			else if (i < t) {
				FOR(p, i, t) {
					if (flag == true) {
						th += a[p];
						flag = false;
						
					}
					else {
						ah += a[p];
						flag = true;
					}
				}
			}
			cout << i << " " << t << " " << th << " " << ah <<" "<<t_min<<" "<<a_max<< endl;
			if (ah > a_max) {
				a_max = ah;
				tp = th;
				//cout << i << " " << t << " " << a_max << " " << t_max << endl;
			}
		}
		if (t_min < tp) {
			t_min = tp;
		}
	}

	cout << t_min << endl;
	return 0;
}

Submission Info

Judge Result