hdoj 2452 Navy maneuvers

类型：有向无环图DP

题目：http://acm.hdu.edu.cn/showproblem.php?pid=2452

来源：2008 Asia Regional Harbin

思路：题中给定一个有"根"节点的有向无环图，可以从该点开始自定向下进行记忆化搜索，当搜索到节点v时，求出其两种状态的值。

即dp[v][0]表示自节点v开始Victory先走的最优值，dp[v][1]表示自节点v开始Glory先走的最优值

dp[u][1] = max(dp[u][1], dp[v][0] + val[u]);
dp[u][0] = min(dp[u][0], dp[v][1] + val[u]);

// hdoj 2452 Navy maneuvers
// ac 31MS 704K
#include <iostream>
#include <sstream>
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <list>
#include <map>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <set>
#include <deque>
#include <bitset>
#include <functional>
#include <utility>
#include <iomanip>
#include <cctype>
using namespace std;

#define FOR(i,a,b) for(i = (a); i < (b); ++i)
#define FORE(i,a,b) for(i = (a); i <= (b); ++i)
#define FORD(i,a,b) for(i = (a); i > (b); --i)
#define FORDE(i,a,b) for(i = (a); i >= (b); --i)
#define max(a,b) ((a) > (b)) ? (a) : (b)
#define min(a,b) ((a) < (b)) ? (a) : (b)
#define CLR(a,b) memset(a,b,sizeof(a))
#define PB(x) push_back(x)

const int MAXN = 10100;
const int MAXM = 400100;
const int hash_size = 25000002;
const int INF = 0x7f7f7f7f;

bool sign;
int cnt, n, m, f, max_val;
int head[MAXN], val[MAXN], ru[MAXN], chu[MAXN], dp[MAXN][2];
struct node {
    int v, nxt, w;
}p[MAXM];

void addedge(int u, int v, int w) {
    p[cnt].v = v, p[cnt].w = w, p[cnt].nxt = head[u], head[u] = cnt++;
}

void tree_dp(int u) {
    if(dp[u][0] != -1 || dp[u][1] != -1)
        return ;
    if(chu[u] == 0) {
        dp[u][0] = dp[u][1] = val[u];
        return ;
    }
    dp[u][0] = INF, dp[u][1] = -INF;
    for(int i = head[u]; i != -1; i = p[i].nxt) {
        int v = p[i].v;
        tree_dp(v);
        dp[u][1] = max(dp[u][1], dp[v][0] + val[u]);
        dp[u][0] = min(dp[u][0], dp[v][1] + val[u]);
    }
}

void init() {
    CLR(ru, 0);
    CLR(chu, 0);
    CLR(head, -1);
    CLR(val, 0);
    CLR(dp, -1);
    cnt = max_val = 0;
    sign = false;
}

int main() {
    int i, u, v;

    while(scanf("%d %d %d", &n, &m, &f) != EOF) {
        init();
        FORE(i, 1, n)
            scanf("%d", &val[i]);
        FORE(i, 1, m) {
            scanf("%d %d", &u, &v);
            ++ru[v], ++chu[u];
            addedge(u, v, val[v]);
        }
        FORE(i, 1, n)
            if(ru[i] == 0) {
                tree_dp(i);
                break;
            }
        if(dp[i][1] >= f)
            printf("Victory\n");
        else
            printf("Glory\n");
    }
    return 0;
}