HDU 5115 Dire Wolf （区间dp）

最新推荐文章于 2022-06-04 18:17:45 发布

TaoSama

最新推荐文章于 2022-06-04 18:17:45 发布

阅读量431

点赞数

分类专栏：动态规划文章标签：区间dp

本文链接：https://blog.csdn.net/lwt36/article/details/49055347

版权

动态规划专栏收录该内容

135 篇文章 0 订阅

订阅专栏

题意:

$N<=200只狼，每只狼有两种属性，一种攻击力一种附加值$
$每杀一只狼，那么我们受到的伤害值为这只狼的攻击值与它旁边的两只狼的附加值的和$
$求把所有狼都杀光受到的最小的伤害值$

分析:

$很明显的区间dp, dp[i][j]:= 杀完[i,j]区间狼所承受的最小伤害$
$这样的话枚举最后一次杀的狼就好了$
$dp[l][r] += min\{dp[l][i-1] + dp[i+1][r] + a[i] + a[l-1]+a[r+1], i \in[l,r]\}$

代码:

//
//  Created by TaoSama on 2015-10-11
//  Copyright (c) 2015 TaoSama. All rights reserved.
//
//#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <set>
#include <vector>

using namespace std;
#define pr(x) cout << #x << " = " << x << "  "
#define prln(x) cout << #x << " = " << x << endl
const int N = 1e5 + 10, INF = 0x3f3f3f3f, MOD = 1e9 + 7;

int n, a[205], b[205];
int dp[205][205];

int dfs(int l, int r) {
    int &ret = dp[l][r];
    if(ret >= 0) return ret;
    if(l > r) return 0;
    ret = 0;
    int minv = INF;
    for(int i = l; i <= r; ++i) {
        minv = min(minv, dfs(l, i - 1) + dfs(i + 1, r) +
                   a[i] + b[l - 1] + b[r + 1]);
    }
    ret += minv;
    return ret;
}

int main() {
#ifdef LOCAL
    freopen("C:\\Users\\TaoSama\\Desktop\\in.txt", "r", stdin);
//  freopen("C:\\Users\\TaoSama\\Desktop\\out.txt","w",stdout);
#endif
    ios_base::sync_with_stdio(0);

    int t; scanf("%d", &t);
    int kase = 0;
    while(t--) {
        scanf("%d", &n);
        for(int i = 1; i <= n; ++i) scanf("%d", a + i);
        for(int i = 1; i <= n; ++i) scanf("%d", b + i);
        b[0] = b[n + 1] = 0;

        memset(dp, -1, sizeof dp);
        printf("Case #%d: %d\n", ++kase, dfs(1, n));
    }
    return 0;
}