hdu 5115 Dire Wolf【区间dp】

题目大意：
n只狼排成直线，第i只狼基础攻击力为ai,辅助攻击力bi，杀死第i只狼会损耗a(i)+b(i-1)+b(i+1)点体力,问最少多少体力可以把狼全部杀死。

思路：
dp[i][j]表示杀死第i到第j只狼最少消耗，枚举k表示最后杀死的狼，
则有：dp[i][j] = min(dp[i][j], dp[i][k-1]+dp[k+1][j]+a[k]+b[i-1]+b[j+1])。
处理下边界即可。

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

const int MAXN = 210;
int a[MAXN], b[MAXN], dp[MAXN][MAXN];

int main(int argc, char const *argv[])
{
    int t;
    scanf("%d", &t);
    for(int l = 1; l <= t; l++)
    {
        int n;
        scanf("%d", &n);
        for(int i = 1; i <= n; i++)
            scanf("%d", &a[i]);
        for(int i = 1; i <= n; i++)
            scanf("%d", &b[i]);
        b[0] = b[n+1] = 0;

        for(int i = 1; i <= n; i++)
            dp[i][i] = a[i] + b[i-1] + b[i+1];

        for(int t = 2; t <= n; t++)
            for(int i = 1; i <= n+1-t; i++)
            {
                int j = i + t - 1;
                dp[i][j] = min(dp[i+1][j] + a[i] + b[i-1] + b[j+1], dp[i][j-1] + a[j] + b[i-1] + b[j+1]);
                for(int k = i+1; k < j; k++)
                    dp[i][j] = min(dp[i][j], dp[i][k-1] + dp[k+1][j] + a[k] + b[i-1] + b[j+1]);
            }
        printf("Case #%d: %d\n", l, dp[1][n]);
    }   
    return 0;
}