Submission #2141436

---

Source Code Expand

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

const int N = 200005;
const long long INF = 1e18;

int n, m;
int a[N], x[N];
long long s[N];
long long dp[N];

int main() {
	ios_base::sync_with_stdio(false); cin.tie(0);
	cin >> n;
	for (int i = 1; i <= n - 1; ++i) {
		cin >> a[i];
	}
	cin >> m;
	for (int i = 1; i <= m; ++i) {
		cin >> x[i];
	}
	assert(m == 1);
	
	a[n] = x[1];

	for (int i = 1; i <= n; ++i) dp[i] = -INF;
	for (int i = 1; i <= n; ++i) s[i] = s[i - 1] + a[i];

	dp[n] = a[n - 1] - a[n];
	for (int i = n - 1; i >= 2; --i) {
		for (int j = i + 1; j <= n; ++j) {
			dp[i] = max(dp[i], -dp[j] + a[i - 1] - s[j - 2] + s[i - 1]);
		}
	}

	cout << dp[2] << endl;
}

Submission Info

Judge Result