杀掉某只狼之后, 他左右的狼会相邻。
杀掉某个区间的狼之后,攻击力是区间两边的狼的加成。
#include <cstdio>
#include <cstring>
#include <iostream>
#include <cstdlib>
using namespace std;
#define MAXN (200+20)
int a[MAXN], b[MAXN];
int dp[MAXN][MAXN];
int main()
{
int T;
cin >> T;
for(int t = 1; t <= T; ++ t)
{
int n;
cin >> n;
for(int i = 1; i <= n; ++ i) scanf("%d", &a[i]);
for(int i = 1; i <= n; ++ i) scanf("%d", &b[i]);
#define INF (1e9)
for(int i = 1; i <= n; ++ i)
for(int j = i; j <= n; ++ j)
dp[i][j] = INF;
for(int i = n; i >= 1; -- i)
for(int j = i; j <= n; ++ j)
for(int k = i; 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", t, dp[1][n]);
}
return 0;
}
/*
2
3
3 5 7
8 2 0
10
1 3 5 7 9 2 4 6 8 10
9 4 1 2 1 2 1 4 5 1
Case #1: 17
Case #2: 74
*/