hdu 4784 Dinner Coming Soon（dp）

做法：由于时间不可逆，所以无后效性，直接4维状态，时间，第几个宇宙，第几维，有多少物品，的最大钱数。转移很显然。

AC代码：

#pragma comment(linker, "/STACK:102400000,102400000")
#include<cstdio>
#include<ctype.h>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<vector>
#include<cstdlib>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<cmath>
#include<ctime>
#include<string.h>
#include<string>
#include<sstream>
#include<bitset>
using namespace std;
#define ll __int64
#define ull unsigned __int64
#define eps 1e-8
#define NMAX 200000000
#define MOD 1000000007
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define PI acos(-1)
template<class T>
inline void scan_d(T &ret)
{
    char c;
    int flag = 0;
    ret=0;
    while(((c=getchar())<'0'||c>'9')&&c!='-');
    if(c == '-')
    {
        flag = 1;
        c = getchar();
    }
    while(c>='0'&&c<='9') ret=ret*10+(c-'0'),c=getchar();
    if(flag) ret = -ret;
}
const int maxn = 1005;
int head[105];
struct Edge
{
    int v,next,w,co;
}e[205];
int ecnt;

void add_edge(int u, int v, int w, int co)
{
    e[ecnt].v = v; e[ecnt].w = w; e[ecnt].co = co;
    e[ecnt].next = head[u];
    head[u] = ecnt++;
}

int dp[305][105][6][5];
int a[105][6];

int main()
{
#ifdef GLQ
    freopen("input.txt","r",stdin);
//    freopen("o1.txt","w",stdout);
#endif
    int _t,cas = 1;
    scanf("%d",&_t);
    while(_t--)
    {
        ecnt = 0;
        memset(head,-1,sizeof(head));
        int n,m,B,K,R,T;
        scanf("%d%d%d%d%d%d",&n,&m,&B,&K,&R,&T);
        memset(dp,-1,sizeof(dp));
        for(int i = 0; i < K; i++)
            for(int j = 1; j <= n; j++)
                scanf("%d",&a[j][i]);
        for(int i = 1; i <= m; i++)
        {
            int u,v,w,co;
            scanf("%d%d%d%d",&u,&v,&w,&co);
            add_edge(u,v,w,co);
        }
        dp[0][1][0][0] = R;
        int ans = -1;
        for(int i = 0; i <= T; i++)
        {
            for(int j = 1; j < n; j++)
                for(int k = 0; k < K; k++)
                    for(int l = 0; l <= B; l++) if(dp[i][j][k][l] != -1)
                    {
                        for(int p = head[j]; ~p; p = e[p].next)
                        {
                            int v = e[p].v;
                            if(dp[i][j][k][l] < e[p].co) continue;
                            for(int ha = 0; ha <= 1; ha++) if(ha <= l)
                            {
                                if(ha == 1 && (v == 1 || v == n)) continue;
                                dp[i+e[p].w][v][k][l-ha] = max(dp[i+e[p].w][v][k][l-ha],dp[i][j][k][l]-e[p].co+ha*a[v][k]);
                            }
                            if(v != 1 && v != n && l < B && dp[i][j][k][l]-e[p].co-a[v][k] >= 0)
                            {
                                dp[i+e[p].w][v][k][l+1] = max(dp[i+e[p].w][v][k][l+1], dp[i][j][k][l]-e[p].co-a[v][k]);
                            }
                        }
                        if(j == 1) continue;
                        for(int ha = 0; ha <= 1; ha++) if(ha <= l)
                        {
                            dp[i+1][j][(k+1)%K][l-ha] = max(dp[i+1][j][(k+1)%K][l-ha], dp[i][j][k][l]+ha*a[j][(k+1)%K]);
                        }
                        if(l < B && dp[i][j][k][l] >= a[j][(k+1)%K])
                        {
                            dp[i+1][j][(k+1)%K][l+1] = max(dp[i+1][j][(k+1)%K][l+1], dp[i][j][k][l]-a[j][(k+1)%K]);
                        }
                    }
            ans = max(ans,dp[i][n][0][0]);
        }
        printf("Case #%d: ",cas++);
        if(ans == -1) printf("Forever Alone\n");
        else printf("%d\n",ans);
    }
    return 0;
}