区间DP 含模板 取石子问题

//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>
#include <math.h>

#define INF 0x3f3f3f3f
#define MAXN 105

const int mod = 1e9 + 7;

using namespace std;

int a[MAXN];
int sum[MAXN];
int dpmax[MAXN][MAXN];
int dpmin[MAXN][MAXN];

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

	int N;
	while (cin >> N) {

		for (int i = 1; i <= N; i++)
			scanf("%d", &a[i]), sum[i] = sum[i - 1] + a[i];

		memset(dpmax, 0, sizeof(dpmax));
		memset(dpmin, 0x3f, sizeof(dpmin));

		for (int len = 0; len < N; len++) {					//必须从0开始遍历为了初始化dpmin[i][i]=0
			for (int i = 1; i + len <= N; i++) {			//i--N的一个遍历并且保证j不会越界
				dpmin[i][i] = 0;							//初始化dpmin
				int j = i + len;							//找到j
				for (int k = i; k < j; k++) {				//i--j的一个暴力遍历
					dpmax[i][j] = max(dpmax[i][j], dpmax[i][k] + dpmax[k + 1][j] + sum[j] - sum[i - 1]);
					dpmin[i][j] = min(dpmin[i][j], dpmin[i][k] + dpmin[k + 1][j] + sum[j] - sum[i - 1]);
				}
			}
		}

		cout << dpmin[1][N] << ' ' << dpmax[1][N] << endl;
	}

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