HDU 5115 Dire Wolf(区间dp)
2015-07-16 22:54
477 查看
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5115
题面:
Time Limit: 5000/5000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)
Total Submission(s): 687 Accepted Submission(s): 391
Problem Description
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
Sample Output
Source
2014ACM/ICPC亚洲区北京站
题意:求杀死所有狼受到的最小伤害,狼本身的伤害是固定的,累加就好。每次杀一只狼会受到其旁边剩下的狼的加成攻击。类似于矩阵连乘,以区间长度从小到大dp,长度为2,好像巧妙地避开了特判。原来区间dp也不是很难,主要是能够构建出这个模型来。
代码:
题面:
Dire Wolf
Time Limit: 5000/5000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 687 Accepted Submission(s): 391
Problem Description
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 HintIn the first sample, Matt defeats the dire wolves from left to right. He takes 5 + 5 + 7 = 17 points of damage which is the least damage he has to take.
Source
2014ACM/ICPC亚洲区北京站
题意:求杀死所有狼受到的最小伤害,狼本身的伤害是固定的,累加就好。每次杀一只狼会受到其旁边剩下的狼的加成攻击。类似于矩阵连乘,以区间长度从小到大dp,长度为2,好像巧妙地避开了特判。原来区间dp也不是很难,主要是能够构建出这个模型来。
代码:
#include <iostream> #include <cstdio> #include <cstring> #include <queue> #include <map> #include <cmath> #include <cstdlib> #include <set> #include <algorithm> #include <string> #include <iomanip> #define LL long long using namespace std; int store[222]; int dp[220][220]; int main() { int t,n,ans,tmp,lim; scanf("%d",&t); for(int i=1;i<=t;i++) { printf("Case #%d: ",i); ans=0; scanf("%d",&n); store[0]=store[n+1]=0; for(int j=0;j<n;j++) { scanf("%d",&tmp); ans+=tmp; } for(int j=1;j<=n;j++) { scanf("%d",&store[j]); } for(int j=1;j<=n;j++) dp[j][j]=(store[j-1]+store[j+1]); for(int j=2;j<=n;j++) { lim=n-j+1; for(int k=1;k<=lim;k++) { dp[k][k+j-1]=dp[k+1][k+j-1]+store[k-1]+store[k+j]; for(int m=k;m<=k+j-1;m++) { dp[k][k+j-1]=min(dp[k][k+j-1],dp[k][m-1]+dp[m+1][k+j-1]+store[k-1]+store[k+j]); } } } ans+=dp[1] ; printf("%d\n",ans); } return 0; }
相关文章推荐
- HTTP协议之介绍
- c++中new分配动态数组
- 在Inspector 中 设置添加回调函数 - Unity3d编辑器扩展
- 我的Android进阶之旅------> Android为TextView组件中显示的文本添加背景色
- hdu1028 Ignatius and the Princess III(DP整数划分)
- 击穿缓存
- Lucene Query Term Weighting
- jQuery的事件委托实例分析
- javascript的typeof操作的返回值类型
- java集合框架——详解List、Set、Map
- [javascript]一种兼容性比较好的简单拖拽
- 系统优化与调度——非线性规划问题:梯度投影法之MATLAB实现
- 深入理解JavaScript系列(36):设计模式之中介者模式
- poj 1065 最长上升子序列
- 深入理解JavaScript系列(37):设计模式之享元模式
- Potocol Buffer详解
- nodejs+express +jade模板引擎 新建项目
- MyBatis知多少(9)不同类型的数据库
- hdu1029 Ignatius and the Princess IV(DP求数列中出现次数过半的数)
- php-max_execution_time