poj-1651 Multiplication Puzzle 区间DP

题目链接

dp[i][j]表示i到j区间的值。

假设 i <= k <= j，最后剩下k时,1-k与k-n一定已取。

故的转移方程 

dp[i][j] = min( dp[i][j],dp[i][k] + dp[k][j] + num[i]*num[k]*num[j]  );

#include<stdio.h>
#include<iostream>
#include<string>
#include<string.h>
#include<vector>
#include<queue>
#include<map>
#include<algorithm>
using namespace std;
const int maxn = 105;
const int inf = 1<<30;
int n;
int num[maxn],dp[maxn][maxn];
void GetDp()
{
	memset( dp,0,sizeof(dp) );
	for( int r = 2; r <= n; r ++ )
	{
		for( int i = 1; i+r <= n; i ++ ){
			int j = i+r;
			dp[i][j] = inf;
			for( int k = i; k <= j; k ++ )
			{
				dp[i][j] = min( dp[i][j],dp[i][k] + dp[k][j] + num[i]*num[k]*num[j]  );
			}
		}
	}
}
int main()
{
	freopen("data.txt","r",stdin);
	while( scanf("%d",&n) != EOF )
	{
		for( int i = 1; i <= n; i ++ )
			scanf("%d",&num[i]);
		GetDp();
		printf("%d\n",dp[1][n]);
	}
	return 0;
}