【HDOJ】2851 Lode Runner

开始没理解题意。原来destinations是指路的序号。而不是点。DP。

#include <stdio.h>
#include <string.h>

int dp[2005];

typedef struct {
    int s, e, w;
} road_st;

road_st roads[2005];

int main() {
    int case_n;
    int n, m, des;
    int i, j, min;

    scanf("%d", &case_n);

    while (case_n--) {
        scanf("%d%d", &n, &m);
        for (i=1; i<=n; ++i)
            scanf("%d%d%d", &roads[i].s, &roads[i].e, &roads[i].w);
        memset(dp, 0, sizeof(dp));
        dp[1] = roads[1].w;
        for (i=2; i<=n; ++i) {
            min = 0x7fffffff;
            for (j=1; j<i; ++j) {
                if (roads[i].s <= roads[j].e && dp[j]!=-1 && dp[j]<min)
                    min = dp[j];
            }
            if (min < 0x7fffffff)
                dp[i] = min + roads[i].w;
            else
                dp[i] = -1;
        }
        for (i=0; i<m; ++i) {
            scanf("%d", &des);
            printf("%d
", dp[des]);
        }
    }

    return 0;
}