hdu4571 Travel in time

　　Bob gets tired of playing games, leaves Alice, and travels to Changsha alone. Yuelu Mountain, Orange Island, Window of the World, the Provincial Museum etc...are scenic spots Bob wants to visit. However, his time is very limited, he can’t visit them all.
　　Assuming that there are N scenic spots in Changsha, Bob defines a satisfaction value Si to each spot. If he visits this spot, his total satisfaction value will plus Si. Bob hopes that within the limited time T, he can start at spot S, visit some spots selectively, and finally stop at spot E, so that the total satisfaction value can be as large as possible. It's obvious that visiting the spot will also cost some time, suppose that it takes C _i units of time to visit spot i ( 0 <= i < N ).
　　Always remember, Bob can choose to pass by a spot without visiting it (including S and E), maybe he just want to walk shorter distance for saving time.
　　Bob also has a special need which is that he will only visit the spot whose satisfaction value is strictly larger than that of which he visited last time. For example, if he has visited a spot whose satisfaction value is 50, he would only visit spot whose satisfaction value is 51 or more then. The paths between the spots are bi-directional, of course.

　　The first line is an integer W, which is the number of testing cases, and the W sets of data are following.
　　The first line of each test data contains five integers: N M T S E. N represents the number of spots, 1 < N < 100; M represents the number of paths, 0 < M < 1000; T represents the time limitation, 0 < T <= 300; S means the spot Bob starts from. E indicates the end spot. (0 <= S, E < N)
　　The second line of the test data contains N integers C _i ( 0 <= C _i <= T ), which means the cost of time if Bob visits the spot i.
　　The third line also has N integers, which means the satisfaction value Si that can be obtained by visiting the spot i ( 0 <= S _i < 100 ).
　　The next M lines, each line contains three integers u v L, means there is a bi-directional path between spot u and v and it takes L units of time to walk from u to v or from v to u. (0 <= u, v < N, 0 <= L <= T)

　　Output case number in the first line (formatted as the sample output).
　　The second line contains an integer, which is the greatest satisfaction value.
If Bob can’t reach spot E in T units of time, you should output just a “0” (without quotation marks).

  

   1
4 4 22 0 3
1 1 1 1
5 7 9 12
0 1 10
1 3 10
0 2 10
2 3 10
  

  

   Case #1:
21
  

2013 ACM-ICPC长沙赛区全国邀请赛——题目重现

zhoujiaqi2010

水dp，就是处理的时候复杂一点而已。

#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;

typedef struct
{
    int c,s,num;
}Point;

int map[105][105];
Point a[105];
int hash[105];
int dp[105][305];

bool cmp(Point x,Point y)
{
    if (x.s!=y.s) return x.s<y.s;
    return x.num<y.num;
}

int main()
{
    int i,j,n,m,t,s,x,y,z,ans,e,k,T,cnt=1;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d%d%d%d%d",&n,&m,&t,&s,&e);
        for (i=0;i<n;i++)
        {
            scanf("%d",&a[i].c);
        }
        for (i=0;i<n;i++)
        {
            scanf("%d",&a[i].s);
            a[i].num=i;
        }
        sort(a,a+n,cmp);
        for (i=0;i<n;i++)
        {
            hash[a[i].num]=i;
        }
        s=hash[s];
        e=hash[e];
        for (i=0;i<n;i++)
        {
            for (j=0;j<n;j++)
            {
                if (i==j) map[i][j]=0;
                else map[i][j]=100000000;
            }
        }
        for (i=0;i<m;i++)
        {
            scanf("%d%d%d",&x,&y,&z);
            x=hash[x];
            y=hash[y];
            map[x][y]=min(map[x][y],z);
            map[y][x]=min(map[y][x],z);
        }
        for (k=0;k<n;k++)
        {
            for (i=0;i<n;i++)
            {
                for (j=0;j<n;j++)
                {
                    map[i][j]=min(map[i][k]+map[k][j],map[i][j]);
                }
            }
        }
        printf("Case #%d:\n",cnt++);
        memset(dp,-1,sizeof(dp));
        for (i=0;i<n;i++)
        {
            for (j=a[i].c+map[i][s];j<=t;j++)
            {
                dp[i][j]=a[i].s;
            }
        }
        for (i=0;i<n;i++)
        {
            for (j=0;j<i;j++)
            {
                if (a[j].s==a[i].s) break;
                for (k=0;k<=t;k++)
                {
                    if (k<a[i].c+map[i][j]) continue;
                    if (dp[j][k-a[i].c-map[i][j]]==-1) continue;
                    dp[i][k]=max(dp[i][k],dp[j][k-a[i].c-map[i][j]]+a[i].s);
                }
            }
        }
        ans=0;
        for (i=0;i<n;i++)
        {
            for (j=0;j<=t;j++)
            {
                if (j+map[i][e]>t) break;
                ans=max(ans,dp[i][j]);
            }
        }
        printf("%d\n",ans);
    }
    return 0;
}