ZOJ 3703 Happy Programming Contest(DP)

题目链接

输出路径，搞了一个DFS出来，主要是这里，浪费了好长时间。

#include <cstdio>
#include <string>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
int dp[51][1001];
int c[51],v[51],que[51];
int maxz,ti;
void dfs(int n,int T,int step)
{
    int i,t1,t2;
    if(n == 0)
    {
        if(maxz < step)
        {
            maxz = step;
            sort(que,que+step);
            t1 = t2 = 0;
            for(i = 0;i < step;i ++)
            {
                t1 += que[i];
                t2 += t1;
            }
            ti = t2;
        }
        else if(maxz == step)
        {
            sort(que,que+step);
            t1 = t2 = 0;
            for(i = 0;i < step;i ++)
            {
                t1 += que[i];
                t2 += t1;
            }
            ti = min(t2,ti);
        }
        return ;
    }
    if(dp[n][T] == dp[n-1][T])
    dfs(n-1,T,step);
    if(T >= c[n]&&dp[n][T] == dp[n-1][T-c[n]] + v[n])
    {
        que[step] = c[n];
        dfs(n-1,T-c[n],step+1);
    }
    return ;
}
int main()
{
    int cas,T,n,i,j;
    scanf("%d",&cas);
    while(cas--)
    {
        memset(dp,0,sizeof(dp));
        scanf("%d%d",&T,&n);
        for(i = 1;i <= n;i ++)
        scanf("%d",&c[i]);
        for(i = 1;i <= n;i ++)
        scanf("%d",&v[i]);
        for(i = 1;i <= n;i ++)
        {
            for(j = 0;j <= T;j ++)
            {
                if(j >= c[i])
                dp[i][j] = max(dp[i-1][j],dp[i-1][j-c[i]]+v[i]);
                else
                dp[i][j] = dp[i-1][j];
            }
        }
        maxz = 0;
        dfs(n,T,0);
        printf("%d %d %d
",dp[n][T],maxz,ti);
    }
    return 0;
}