HDU 5115 Dire Wolf

 1 #include<cstdio>
 2 #include<algorithm>
 3 #include<cstring>
 4 #define LL long long
 5 #define rg register
 6 #define N 300
 7 using namespace std;
 8 int n,T,t,a[N],b[N],f[N][N];
 9 inline int read(){
10     int k=0,f=1; char c=getchar();
11     while(c<‘0‘||c>‘9‘)c==‘-‘&&(f=-1),c=getchar();
12     while(‘0‘<=c&&c<=‘9‘)k=k*10+c-‘0‘,c=getchar();
13     return k*f;
14 }
15 inline void Pre(){
16     for(rg int i=1;i<=n;i++)
17         for(rg int j=i;j<=n;j++) f[i][j]=1e9;
18 }
19 int main(){
20     T=t=read();
21     while(t--){
22         n=read(); Pre();
23         for(rg int i=1;i<=n;i++) a[i]=read();
24         for(rg int i=1;i<=n;i++) b[i]=read();
25         for(rg int l=0;l<=n;l++){
26             for(rg int i=1;i+l-1<=n;i++){
27                 int j=i+l-1;
28                 for(rg int k=i;k<=j;k++) f[i][j]=min(f[i][j],f[i][k-1]+f[k+1][j]+a[k]+b[i-1]+b[j+1]);
29             }
30         }
31         printf("Case #%d: %d\n",T-t,f[1][n]);
32     }
33     return 0;
34 }