1048 石子归并

#include<iostream>
using namespace std;

int f[101][101] , w[101] , S[101];

int main()
{
	int i,j,n,k;
	cin>>n;
	S[0] = 0;
	for(i = 1; i <= n; i++)
	{
		cin>>w[i];
		f[i][i] = w[i];
		S[i] = S[i-1] + w[i];
	}
	for(i = 1; i <= n; i++)
	{
		for(j = 1; j <= n; j++)
		{
			if(i == j) continue;
			f[i][j] = 10000000;
		}
	}
	int tmpsum;
	for(i = 2; i <= n; i++)
	{
		for(j = 1; j <= n-i+1; j++)
		{
			tmpsum = S[j+i-1] - S[j-1];
			for(k = j; k <= j+i-2; k++)
			{
				if(f[j][j+i-1] > f[j][k] + f[k+1][j+i-1] + tmpsum)
				{
					f[j][j+i-1] = f[j][k] + f[k+1][j+i-1] + tmpsum;
				}
			}
//			cout<<j<<" "<<j+i-1<<" jujian test : "<<f[j][j+i-1]<<endl;
		}
	}
	cout<<f[1][n] - S[n]<<endl;        //注意多加了一次
	return 0;
}

************************************************************************************可供吐槽