石子合并 区间dp 2018-3-6

石子合并（一）

时间限制： 1000 ms  |  内存限制： 65535 KB

难度： 3

描述

    有N堆石子排成一排，每堆石子有一定的数量。现要将N堆石子并成为一堆。合并的过程只能每次将相邻的两堆石子堆成一堆，每次合并花费的代价为这两堆石子的和，经过N-1次合并后成为一堆。求出总的代价最小值。

有多组测试数据，输入到文件结束。
每组测试数据第一行有一个整数n，表示有n堆石子。
接下来的一行有n（0< n <200）个数，分别表示这n堆石子的数目，用空格隔开

输出

输出总代价的最小值，占单独的一行

样例输入

3
1 2 3
7
13 7 8 16 21 4 18

样例输出

9
239

# include <cstdio>
# include <cstdlib>
# include <cmath>
# include <cstring>
# include <string>
# include <iostream>
# include <iomanip>
# include <algorithm>
# include <list>
# include <stack>
# include <vector>
# include <queue>
# include <map>
using namespace std;
const int INF = 0x3f3f3f3f;



int a[201];
int sum[201][201];
int dp[201][201];


int main()
{
	int n;
	while (cin >> n)
	{
		memset(a, 0, sizeof(a));
		memset(dp, 0, sizeof(dp));
		memset(sum, 0, sizeof(sum));
		for (int i = 1; i <= n; i++)cin >> a[i];
		for (int i = 1; i <= n; i++)
		{
			sum[i][i] = a[i];
			dp[i][i] = 0;
			for (int j = i + 1; j <= n; j++)
			{
				sum[i][j] = sum[i][j - 1] + a[j];
			}
		}

		for (int len = 2; len <= n; len++)//区间长度
		{
			for (int start = 1; start <= n - len + 1; start++)
			{
				int end = start + len - 1;
				dp[start][end] = INF;
				for (int k = start; k <= end; k++)
				{
					dp[start][end] = min(dp[start][end],dp[start][k]+dp[k+1][end]+sum[start][end]);
				}

			}
			

		}

		cout << dp[1][n] << endl;
	}

	return 0;
}