Dire WolfTime Limit: 5000/5000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 1262 Accepted Submission(s): 713
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
Sample Output
|
题意:有N匹狼排成一排,第i匹狼具有一个初始攻击a[]力和对邻近单位的加成攻击力b[]。攻击并杀死一匹狼受到的伤害=该狼自身的攻击力 + 邻近狼给它的加成攻击力。问你杀死这N匹狼受到的最少伤害。
你可以任选顺序杀死这N匹狼。当有a b c三匹狼时,杀死狼b,则狼a和狼c相邻。
思路:设置dp[i][j]表示杀死区间[i, j]里面所有狼受到的最少伤害。
我们需要考虑到杀死[i, j]这些狼的可能方案——尝试去枚举最后杀死的狼。暴力维护下就可以了。
时间复杂度O(n^3),完全可以承受。
dp[i][j] = min(dp[i][k-1]+dp[k+1][j]+a[k]+b[i-1]+b[j+1]) (i<=k<=j)
注意边界。
AC代码:
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <vector>
#define INF 0x3f3f3f3f
#define eps 1e-8
#define MAXN (200+10)
#define MAXM (100000)
#define Ri(a) scanf("%d", &a)
#define Rl(a) scanf("%lld", &a)
#define Rf(a) scanf("%lf", &a)
#define Rs(a) scanf("%s", a)
#define Pi(a) printf("%d\n", (a))
#define Pf(a) printf("%.2lf\n", (a))
#define Pl(a) printf("%lld\n", (a))
#define Ps(a) printf("%s\n", (a))
#define W(a) while(a--)
#define CLR(a, b) memset(a, (b), sizeof(a))
#define MOD 1000000007
#define LL long long
#define lson o<<1, l, mid
#define rson o<<1|1, mid+1, r
#define ll o<<1
#define rr o<<1|1
using namespace std;
int a[MAXN], b[MAXN];
int dp[MAXN][MAXN];
int main()
{
int t, kcase = 1;
Ri(t);
W(t)
{
int n; Ri(n);
for(int i = 1; i <= n; i++)
Ri(a[i]);
for(int i = 1; i <= n; i++)
Ri(b[i]);
CLR(dp, INF); b[0] = b[n+1] = 0;
for(int i = n; i >= 1; i--)
{
for(int j = i; j <= n; j++)
{
if(i == j)
{
dp[i][j] = a[i] + b[i-1] + b[i+1];
continue;
}
for(int k = i; k <= j; k++)
{
if(k == i)
dp[i][j] = min(dp[i][j], dp[k+1][j]+a[k]+b[i-1]+b[j+1]);
else if(k == j)
dp[i][j] = min(dp[i][j], dp[i][k-1]+a[k]+b[i-1]+b[j+1]);
else
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", kcase++, dp[1][n]);
}
return 0;
}