Submission #3663390

---

Source Code Expand

#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
const long long lim = 1000000000000;
const int inf = 1012345678;
int main() {
	int N;
	cin >> N;
	vector<int> A(N);
	vector<long long> S(N + 1);
	for (int i = 0; i < N; ++i) {
		cin >> A[i];
		S[i + 1] = S[i] + A[i];
	}
	long long l = -(lim + 1), r = lim + 1;
	while (r - l > 1) {
		long long m = (l + r) >> 1;
		vector<vector<int> > dp(N + 1, vector<int>(2));
		for (int i = N - 1; i >= 0; --i) {
			dp[i][0] = -inf;
			dp[i][1] = inf;
			for (int j = i + 1; j <= N; ++j) {
				dp[i][0] = max(dp[i][0], dp[j][1] + (S[j] - S[i] >= m ? 1 : -1));
				dp[i][1] = min(dp[i][1], dp[j][0] + (S[j] - S[i] >= m ? 1 : -1));
			}
		}
		if (dp[0][0] >= 0) l = m;
		else r = m;
	}
	cout << l << endl;
	return 0;
}

Submission Info

Judge Result