【HDOJ】1224 Free DIY Tour

DP。

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <iostream>
using namespace std;

#define MAXN 105
int score[MAXN];
bool map[MAXN][MAXN];
int path[MAXN];
int dp[MAXN];

void print_path(int x) {
    if (path[x] != 0)
        print_path(path[x]);
    printf("%d->", x);
}

int main() {
    int t, n, m;
    int i, j, k, tmp;

#ifndef ONLINE_JUDGE
    freopen("data.in", "r", stdin);
#endif

    scanf("%d", &t);
    for (k=1; k<=t; ++k) {
        scanf("%d", &n);
        for (i=1; i<=n; ++i)
            scanf("%d", &score[i]);
        score[n+1] = 0;
        memset(map, false, sizeof(map));
        memset(dp, 0, sizeof(dp));
        memset(path, 0, sizeof(path));
        scanf("%d", &m);
        while (m--) {
            scanf("%d %d", &i, &j);
            map[i][j] = true;
        }
        for (i=1; i<=n+1; ++i) {
            int max = 0, v = 0;
            for (j=1; j<i; ++j) {
                if (map[j][i] && dp[j] >= max) {
                    max = dp[j];
                    v = j;
                }
            }
            dp[i] = max + score[i];
            path[i] = v;
        }
        printf("CASE %d#
", k);
        printf("points : %d
", dp[n+1]);
        printf("circuit : ");
        print_path(path[n+1]);
        printf("1
");
        if (k != t)
            printf("
");
    }

    return 0;
}