hdu5115 Dire Wolf

题目链接

区间DP

$dp_{i,j}$为杀掉$i~j$内的狼的最小代价

枚举$i~j$中最后杀掉的狼，$dp_{i,j}=min{ { {kin{[i,j]}} | dp_{i,k-1}+dp_{k+1,j}+A_k+B_{i-1}+B_{j+1}} }$

#include<cstdio>
#include<iostream>
#include<cstdlib>
#include<cstring>
#define re(i,l,r) for(int i=(l);i<=(r);i++)
#define rre(i,r,l) for(int i=(r);i>=(l);i--)
using namespace std;
typedef long long LL;
int t,A[222],B[222],n;
LL hh[222][222];
LL dfs(int l,int r)
{
    LL &ret=hh[l][r];
    if(ret)return ret;
    ret=1LL<<60;
    if(l>r)return ret=0;LL now=B[l-1]+B[r+1];
    re(i,l,r)ret=min(dfs(l,i-1)+dfs(i+1,r)+A[i]+now,ret);
    return ret;
}
int main()
{
    scanf("%d",&t);int tt=t;
    while(t--)
    {
        printf("Case #%d: ",tt-t);
        memset(hh,0,sizeof(hh));
        scanf("%d",&n);
        re(i,1,n)scanf("%d",&A[i]);
        re(i,1,n)scanf("%d",&B[i]);
        printf("%lld
",dfs(1,n));
    }
    return 0;
}