Dire wolves, also known as Dark wolves, are extraordinarily large and powerful wolves. Many, if not all, Dire Wolves appear to originate from Draenor.
Dire wolves look like normal wolves, but these creatures are of nearly twice the size. These powerful beasts, 8 - 9 feet long and weighing 600 - 800 pounds, are the most well-known orc mounts. As tall as a man, these great wolves have long tusked jaws that look like they could snap an iron bar. They have burning red eyes. Dire wolves are mottled gray or black in color. Dire wolves thrive in the northern regions of Kalimdor and in Mulgore.
Dire wolves are efficient pack hunters that kill anything they catch. They prefer to attack in packs, surrounding and flanking a foe when they can.
— Wowpedia, Your wiki guide to the World of Warcra

Matt, an adventurer from the Eastern Kingdoms, meets a pack of dire wolves. There are N wolves standing in a row (numbered with 1 to N from left to right). Matt has to defeat all of them to survive.

Once Matt defeats a dire wolf, he will take some damage which is equal to the wolf’s current attack. As gregarious beasts, each dire wolf i can increase its adjacent wolves’ attack by bi. Thus, each dire wolf i’s current attack consists of two parts, its basic attack ai and the extra attack provided by the current adjacent wolves. The increase of attack is temporary. Once a wolf is defeated, its adjacent wolves will no longer get extra attack from it. However, these two wolves (if exist) will become adjacent to each other now.

For example, suppose there are 3 dire wolves standing in a row, whose basic attacks ai are (3, 5, 7), respectively. The extra attacks bi they can provide are (8, 2, 0). Thus, the current attacks of them are (5, 13, 9). If Matt defeats the second wolf first, he will get 13 points of damage and the alive wolves’ current attacks become (3, 15).

As an alert and resourceful adventurer, Matt can decide the order of the dire wolves he defeats. Therefore, he wants to know the least damage he has to take to defeat all the wolves.

 

Input

The first line contains only one integer T , which indicates the number of test cases. For each test case, the first line contains only one integer N (2 ≤ N ≤ 200).

The second line contains N integers ai (0 ≤ ai ≤ 100000), denoting the basic attack of each dire wolf.

The third line contains N integers bi (0 ≤ bi ≤ 50000), denoting the extra attack each dire wolf can provide.

 

Output

For each test case, output a single line “Case #x: y”, where x is the case number (starting from 1), y is the least damage Matt needs to take.

 

Sample Input

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

Sample Output

Case #1: 17
Case #2: 74 这道题到着区间dp,枚举最后杀哪头狼,这样就不会有麻烦了。
 #include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;
const int N=;
int dp[N][N],a[N],n,sum;
int main(){
int T,cas=;
scanf("%d",&T);
while(T--){
scanf("%d",&n);sum=;
for(int i=,x;i<=n;i++){
scanf("%d",&x);sum+=x;
}
for(int i=;i<=n;i++)
scanf("%d",&a[i]);
a[]=a[n+]=;
memset(dp,,sizeof(dp));
for(int i=;i<=n;i++){
dp[i][i]=a[i-]+a[i+];
dp[i][i-]=;
}dp[n+][n]=;
for(int l=;l<=n;l++)
for(int i=,j;i+l-<=n;i++){
j=i+l-;
for(int k=i;k<=j;k++)
dp[i][j]=min(dp[i][j],dp[i][k-]+dp[k+][j]+a[i-]+a[j+]);
//dp[i][j]+=a[i-1]+a[j+1];
}
printf("Case #%d: %d\n",++cas,sum+dp[][n]);
}
return ;
}
												
																

最新文章

  1. C# 控制台程序实现 Ctrl + V 粘贴功能
  2. VSFTPD添加用户
  3. elastic search查询命令集合
  4. 使用C++还是QML
  5. [开发笔记]-sqlite数据库在使用时遇到的奇葩问题记录
  6. SharePoint 2013 Nintex Workflow 工作流帮助(八)
  7. unity, ugui input field
  8. So many good projects for studying C programming lanuage.
  9. C++访问权限
  10. Java中的继承与组合
  11. pandas的札记
  12. ADODB.Connection 错误 &#39;800a0e7a&#39;
  13. bos项目经验心得(1)
  14. [转]makefile文件的编写规则及实例
  15. JavaWeb笔记一、Servlet 详解
  16. FastJson简单使用
  17. selenium模块
  18. 超哥笔记 -- 用户管理、权限设置、进程管理、中文配置、计划任务和yum源配置(5)
  19. mysql排序(四)
  20. MongoDB $关键字 关系比较符号 $lt $lte $gt $gte $ne

热门文章

  1. C语言程序设计第二次作业
  2. 值栈(Structs2)
  3. c语言 指针的值
  4. c &amp; c++中static的总结
  5. struts总结
  6. Gprinter Android SDK V2.1 使用说明
  7. 区间dp模型之括号匹配打印路径 poj(1141)
  8. MySQL1236错误的恢复
  9. (Zero XOR Subset)-less-线性基
  10. Object.defineProperty之observe实现
  11. mybatis级联
  12. dotTrace 每行执行时间和执行次数
  13. 字符串匹配算法——BF、KMP、Sunday
  14. Keepalived介绍以及在Linux系统下的安装与配置
  15. msysgit 上传文件夹,规范化的日常
  16. docker基本的常用命令
  17. VueJS $refs 在 ElementUI 中遇到的问题
  18. PHP获取路径
  19. tyvj 1057 金明的预算方案 背包dp
  20. p2501 [HAOI2006]数字序列