hdu5115 Dire Wolf

题目链接

区间DP

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

枚举$i~j$中最后杀掉的狼，$dp_{i,j}=min\{ { {k\in{[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[],B[],n;
 LL hh[][];
 LL dfs(int l,int r)
 {
     LL &ret=hh[l][r];
     if(ret)return ret;
     ret=1LL<<;
     if(l>r)return ret=;LL now=B[l-]+B[r+];
     re(i,l,r)ret=min(dfs(l,i-)+dfs(i+,r)+A[i]+now,ret);
     return ret;
 }
 int main()
 {
     scanf("%d",&t);int tt=t;
     while(t--)
     {
         printf("Case #%d: ",tt-t);
         memset(hh,,sizeof(hh));
         scanf("%d",&n);
         re(i,,n)scanf("%d",&A[i]);
         re(i,,n)scanf("%d",&B[i]);
         printf("%lld\n",dfs(,n));
     }
     return ;
 }