Dire Wolf（区间dp1001）

#include<bits/stdc++.h>
using namespace std;
const int maxn = 220;
int a[maxn], b[maxn], dp[maxn][maxn];
#define inf 0x3f3f3f3f
int main() {
	int t;
	cin >> t;
	int cas = 1;
	while (t--)
	{
		int n;
		cin >> n;
		for (int i = 1; i <= n; i++)cin >>a[i];
		for (int i = 1; i <= n; i++)cin >> b[i];
		b[0] = b[n + 1] = 0;
		memset(dp, 0, sizeof(dp));
		for(int i=1;i<=n;i++)
		{
			for (int j = i; j <= n; j++)
			{
				dp[i][j] = inf;
			}
		}
		for (int len = 1; len <= n; len++)
		{
			for (int i = 1; i + len <= n + 1; i++)
			{
				int j = i + len - 1;
				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", cas++, dp[1][n]);
	}
		
	return 0;
}