题目:NYOJ737
题意:有n堆石子,每堆有a[i]个,每次合并时只能合并相邻的两堆,代价为两堆石子的个数之和。问把这n堆石子合并成一堆需要的最小代价是多少。
解答:
状态:dp[i][j] 表示合并第 i 堆到第 j 堆石子的最小代价
转移方程:dp[i][j] = min(dp[i][j], dp[i][k] + dp[k+1][j] + sum[j] - sum[i-1]);
其中,sum[j]表示第1堆石子到第j堆石子的石子总数
区间dp的经典问题,注意枚举区间的时候要按照区间大小从小到大的顺序进行枚举,初始化的值
不包含四边形优化:
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;
int dp[500][500];
int s[500][500];
const int INF = 0x3fffffff;
int main()
{
int n;
int a[220],sum[220];
while(~scanf("%d",&n))
{
memset(sum,0,sizeof(sum));
memset(s,0,sizeof(s));
for(int i = 1;i <= n;i++)
s[i][i] = i;
for(int i = 1;i <= n;i++)
for(int j = 1;j <= n;j++)
dp[i][j] = INF;///
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++)
dp[i][i] = 0;///
for(int l = 2;l <= n;l++)
for(int i = 1;i <= n;i++){
int j = i + l -1;
for(int k = s[i][j-1];k <= s[i+1][j];k++){
dp[i][j] = min(dp[i][j],dp[i][k] + dp[k+1][j]+sum[j]-sum[i-1]);
if(dp[i][j] == dp[i][k] + dp[k+1][j]+sum[j]-sum[i-1])
s[i][j] = k;
}
}
printf("%d\n",dp[1][n]);
}
return 0;
}
不包含四边形优化:
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;
int dp[500][500];
int s[500][500];
const int INF = 0x3fffffff;
int main()
{
int n;
int a[220],sum[220];
while(~scanf("%d",&n))
{
memset(sum,0,sizeof(sum));
memset(s,0,sizeof(s));
for(int i = 1;i <= n;i++)
s[i][i] = i;
for(int i = 1;i <= n;i++)
for(int j = 1;j <= n;j++)
dp[i][j] = INF;///
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++)
dp[i][i] = 0;///
for(int l = 2;l <= n;l++)
for(int i = 1;i <= n;i++){
int j = i + l -1;
for(int k = s[i][j-1];k <= s[i+1][j];k++){
dp[i][j] = min(dp[i][j],dp[i][k] + dp[k+1][j]+sum[j]-sum[i-1]);
if(dp[i][j] == dp[i][k] + dp[k+1][j]+sum[j]-sum[i-1])
s[i][j] = k;
}
}
printf("%d\n",dp[1][n]);
}
return 0;
}