区间DP 洛谷1430 序列取数

超链接

大佬讲解

//MADE BY Y_is_sunshine;
//#include <bits/stdc++.h>
//#include <memory.h>
#include <algorithm>
#include <iostream>
#include <cstdlib>
#include <cstring>
#include <sstream>
#include <cstdio>
#include <vector>
#include <string>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>

#define INF 0x3f3f3f3f
#define MAXN 1005
const int mod = 1e9 + 7;

using namespace std;

int a[MAXN];
int sum[MAXN];
int dp[MAXN][MAXN];
int f[MAXN][MAXN];
int g[MAXN][MAXN];

int N;

int main()
{
	freopen("data.txt", "r", stdin);

	int T;
	cin >> T;
	while (T--) {
		cin >> N;
		for (int i = 1; i <= N; i++)
			scanf("%d", &a[i]), sum[i] = sum[i - 1] + a[i];
		for (int i = 1; i <= N; i++)
			f[i][i] = g[i][i] = dp[i][i] = a[i];
		for (int len = 1; len < N; len++) {
			for (int i = 1; i + len <= N; i++) {
				int j = i + len;
				int m = 0;
				m = min(m, min(f[i + 1][j], g[i][j - 1]));
				dp[i][j] = sum[j] - sum[i - 1] - m;
				f[i][j] = min(dp[i][j], f[i + 1][j]);
				g[i][j] = min(dp[i][j], g[i][j - 1]);
			}
		}

		cout << dp[1][N] << endl;

	}

	freopen("CON", "r", stdin);
	system("pause");
	return 0;
}