HDU - 5115 Dire Wolf (区间DP)

题目链接

题意:有一群狼，每头狼都有他的基本伤害--你打他他会反击你a[i]，还有一个额外伤害，你打他身边的狼时会受到其伤害b[i]，求最小收到的伤害可以消灭这群狼。

题解:区间dp,状态转移：
       dp[i][j]--表示消灭i到j头狼所受到的最小伤害(p表示是之间最后杀死的狼）
       dp[i][i]=b[i-1]+b[i+1];
       dp[i][j]=min(dp[i][j],dp[i][p-1]+dp[p+1][j]+b[i-1]+b[j+1]);

代码如下:

#include<iostream>
#include<cstring>
#include<string>
#include<cstdio>
#include<cmath>
#include<vector>
#include<queue>
#include<map>
#include<algorithm>
using namespace std;
#define inf 0x3f3f3f3f
#define ll long long
const int maxn = 500;
int dp[maxn][maxn];
int b[maxn];
int main() {
	int t, cas = 1;
	scanf("%d", &t);
	while (t--) {
		int n, sum = 0, x;
		scanf("%d", &n);
		memset(b, 0, sizeof(b));
		for (int i = 1; i <= n; i++) {
			scanf("%d", &x);
			sum += x;
		}
		for (int i = 1; i <= n; i++)scanf("%d", &b[i]);
		for (int i = 1; i <= n; i++)
			for (int j = 1; j <= n; j++) {
				if (j > i)
					dp[i][j] = inf;
				else if (i > j)
					dp[i][j] = 0;
				else
					dp[i][j] = b[i - 1] + b[i + 1];
			}
		for (int l = 1; l <= n; l++)   //区间长度
			for (int i = 1; i + l <= n; i++) {  //i是左边界
				int j = i + l;   //j是右边界
				for (int k = i; k <= j; k++)   //k是最后杀的狼
					dp[i][j] = min(dp[i][j], dp[i][k - 1] + dp[k + 1][j] + b[i - 1] + b[j + 1]);
			}
		printf("Case #%d: %d\n", cas++, dp[1][n] + sum);
	}
	return 1;
}