HDU - 5115 - Dire Wolf

Dire Wolf

Time Limit: 5000/5000 MS (Java/Others)    Memory Limit: 512000/512000 K (Java/Others)
Total Submission(s): 2575    Accepted Submission(s): 1507

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 b _i. 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 b _i  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 a _i  (0 ≤ a _i  ≤ 100000), denoting the basic attack of each dire wolf.

The third line contains N integers b _i  (0 ≤ b _i  ≤ 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


   
   

    
    

     
     Hint
    
    
In 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.
   
   
   
    
  
  

题意：你是一个战士，现在面对一群狼，每只狼都有一定的主动攻击力和附带攻击力。你杀死一只狼。你会受到这只狼的（主动攻击力+旁边两只狼的附带攻击力）伤害。问如何选择杀狼的顺序使得杀完所有狼时，自己受到的伤害最小。（提醒，狼杀死后就消失，身边原本相隔的两只狼会变成相邻，不需要考虑狼围城环这种情况）

区间DP。

设dp[i][j]为消灭i到j只狼的代价，枚举k作为最后一只被杀死的狼，此时会受到a[k]和b[i-1] b[j+1]的伤害 取最小的即可

可列出转移方程：dp[i][j]=Min(dp[i][k-1]+f[k+1][j]+a[k]+b[i-1]+b[j+1])

#include <stdio.h>
#include <string.h>
#include <math.h>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <set>
#define INF 0x3f3f3f3f3f3f3f
using namespace std;
const int MAXN = 2e2 + 10;



int main()
{
    int cast;
    scanf("%d", &cast);
    for (int casi = 1; casi <= cast; ++casi) {
        int n;
        scanf("%d", &n);
        int a[MAXN], b[MAXN];
        for (int i = 1; i <= n; ++i) {
            scanf("%d", &a[i]);
        }
        for (int i = 1; i <= n; ++i) {
            scanf("%d", &b[i]);
        }
        int dp[MAXN][MAXN];     //表示消灭i~j的狼受到的伤害
        memset(dp, 0, sizeof(dp));
        for (int i = 1; i <= n; ++i) {
            for (int j = i; j <= n; ++j) {
                dp[i][j] = 0x3f3f3f3f3f3f;
            }
        }
        for (int len = 1; len <= n; ++len) {
            for (int i = 1; i <= n; ++i) {
                int j = i + len - 1;
                for (int k = i; k <= j; ++k) {  //枚举k是最后一只
                    dp[i][j] = min(dp[i][j], dp[i][k-1]+dp[k+1][j]+b[i-1]+a[k]+b[j+1]);
                }
            }
        }
        printf("Case #%d: %d\n", casi, dp[1][n]);
    }
    return 0;
}