Dire WolfTime
limit:5000/5000 MS (java/others) Memory limit:512000/512000 K (java/others)
Total submission (s): 436 Accepted Submission (s): 251
Problem Descriptiondire Wolves, also known as Dark Wolves, is 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 is of nearly twice the size. These powerful beasts, 8-9 feet long and weighing 600-800 pounds, is the most well-known ORC mounts. As tall as a man, these great wolves has a long tusked jaws that look like they could snap an iron bar. They has burning red eyes. Dire wolves is mottled gray or black in color. Dire wolves thrive in the northern regions of Kalimdor and in Mulgore.
Dire Wolves is 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 for the world of Warcra
Matt, an adventurer from the Eastern kingdoms, meets a pack of dire wolves. There is N wolves standing in a row (numbered with 1 to N from left to right). Matt has the defeat all of them to survive.
Once Matt defeats a dire wolf, he'll take some damage which are equal to the wolf's current attack. As gregarious beasts, each dire wolf I can increase their adjacent wolves ' attack by BI. Thus, each dire wolf I's current attack consists of the II parts, its basic attack AI and the extra attack provided by the CU Rrent adjacent wolves. The increase of attack is temporary. Once A wolf is defeated, its adjacent wolves would no longer get extra attack from it. However, these, wolves (if exist) would become adjacent to each and now.
For example, suppose there is 3 dire wolves standing in a row, whose basic attacks Ai is (3, 5, 7), respectively. The extra attacks bi they can provide is (8, 2, 0). Thus, the current attacks of them is (5, 13, 9). If Matt defeats the second Wolf first, he'll get 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 had to take to defeat all the wolves.
Inputthe 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) and 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.
Outputfor each test case, output a single line "Case #x: Y", where x was the case number (starting from 1), and Y is the least Damage Matt needs to take.
Sample Input
233 5 78 2 0101 3 5 7 9 2 4 6 8 109 4 1 2 1 2 1 4 5 1
Sample Output
Case #1:17Case #2: "Hintin the" RST sample, Matt defeats the dire wolves from left to right. He takes 5 + 5 + 7 = Points of damage which is the least damage he have to take.
SOURCE2014ACM/ICPC Asia Beijing Station-Replay (thanks to the North Division and handing in)
Recommendliuyiding
Test instructions
There is a row of wolves, each wolf has a damage a, and a damage B. When you kill a wolf, you will be harmed by the wolf's damage A and the wolf on both sides of the wolf. If a wolf in a position is killed, the wolf on the left will receive B from the right wolf, because the two wolves are adjacent. The minimum cost of killing a row of wolves.
set DP[I][J] to eliminate the cost of the I to J Wolf, enumeration K as the last killed Wolf, at this time will be affected by a[k] and B[i-1] b[j+1] To minimize the damagethe transfer equation can be listed:dp[i][j]=min (dp[i][k-1]+dp[k+1][j]+a[k]+b[i-1]+b[j+1])
All right...... I didn't think of this DP ... at first. And feel the border to deal with the trouble ... Or the Dfs bar ....
#include < map> #include <string> #include <cstring> #include <cstdio> #include <cstdlib> #include < cmath> #include <queue> #include <vector> #include <iostream> #include <algorithm> #include <bitset> #include <climits> #include <list> #include <iomanip> #include <stack> #include <set>using namespace Std;bool vis[210][210];int a[210],b[210],dp[210][210],n;int dfs (int l,int r) {if (Vis[l][r]) return dp[l][r];vis[l][r]=1;dp[l][r]=100000000;for (int k=l;k<=r;k++) {int t=a[k];if (k-1>=l) T+=dfs (l,k-1); K+1<=R) T+=dfs (k+1,r), if (l>0) t+=b[l-1];if (r+1<n) t+=b[r+1];DP [L][r]=min (dp[l][r],t);} return dp[l][r];} int main () {int t;cin>>t;for (int cs=1;cs<=t;cs++) {cin>>n;for (int i=0;i<n;i++) cin>>a[i];for ( int i=0;i<n;i++) Cin>>b[i];memset (vis,0,sizeof (VIS));p rintf ("Case #%d:%d\n", Cs,dfs (0,n-1));}}
hdu5115 Dire Wolf
