hdu 5115 Dire Wolf(区间dp)

 1 #include<bits/stdc++.h>
 2 #define F(i,a,b) for(int i=(a);i<=(b);++i)
 3 using namespace std;
 4 
 5 const int N=207,inf=3e8+7;
 6 int t,n,a[N],b[N],dp[N][N],cas;
 7 
 8 void up(int &a,int b){if(a>b)a=b;}
 9 
10 int main(){
11     scanf("%d",&t);
12     while(t--)
13     {
14         scanf("%d",&n),b[n+1]=0;
15         F(i,1,n)scanf("%d",a+i);
16         F(i,1,n)scanf("%d",b+i);
17         F(i,1,n)F(j,1,n)dp[i][j]=inf;
18         F(i,1,n)dp[i][i]=a[i]+b[i-1]+b[i+1];
19         F(l,2,n)for(int i=1;i+l-1<=n;i++)
20         {
21             int j=i+l-1;
22             F(k,i,j-1)
23             {
24                 up(dp[i][j],dp[i][k]+dp[k+1][j]-b[k]+b[i-1]);
25                 up(dp[i][j],dp[k+1][j]+dp[i][k]-b[k+1]+b[j+1]);
26             }
27         }
28         printf("Case #%d: %d\n",++cas,dp[1][n]);
29     }
30     return 0;
31 }