【HDU 6083 度度熊的午饭时光】 01背包 + 记录路径

HDU 6083
01背包是好求的
这个记录路径怎么弄呢
我们开一个path数组代表第 i 个物品能到花费 j 的状态
这样i 从 大 到小满足第一个 path[i][j] 为 1 的 i 一定是可行的
因为我们从小到大更新path[i][j] 最后一个肯定是最优的

/*
    if you can't see the repay
    Why not just work step by step
    rubbish is relaxed
    to ljq
*/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;

#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))

typedef pair<int,int> pll;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod =  (int)1e9+7;

ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
void exgcd(ll a,ll b,ll &x,ll &y,ll &d){if(!b) {d = a;x = 1;y=0;}else{exgcd(b,a%b,y,x,d);y-=x*(a/b);}}//printf("%lld*a + %lld*b = %lld\n", x, y, d);

/*namespace sgt
{
    #define mid ((l+r)>>1)

    #undef mid
}*/
const int MAX_N = 105;
int val[MAX_N],w[MAX_N],dp[1025],path[105][1025];
vector<int >ans;
int main()
{
    //ios::sync_with_stdio(false);
    //freopen("a.txt","r",stdin);
    //freopen("b.txt","w",stdout);
    int t,V,n,Case = 0;
    scanf("%d",&t);
    while(t--)
    {
        int sum = 0;
        vector<int> tmp;
        swap(ans,tmp);
        scanf("%d%d",&V,&n);
        memset(dp,0,sizeof(dp));
        memset(path,0,sizeof(path));
        for(int i = 1;i<=n;++i) scanf("%d%d",&val[i],&w[i]);
        for(int i = 1;i<=n;++i)
        {
            for(int j = V;j>=w[i];j--)
            {
                if(dp[j-w[i]]+val[i]>dp[j])
                {
                    path[i][j] = 1;
                    dp[j] = dp[j-w[i]] + val[i];
                }
            }
        }
        for(int i = n,j = V;i>=1&&j>=0;i--)
        {
            if(path[i][j])
            {
                ans.push_back(i);
                sum+=w[i];
                j-=w[i];
            }
        }
        printf("Case #%d:\n",++Case);
        sort(ans.begin(),ans.end());
        printf("%d %d\n",dp[V],sum);
        for(int i = 0;i<ans.size();++i)
            i==ans.size()-1?printf("%d\n",ans[i]):printf("%d ",ans[i]);
    }

    //fclose(stdin);
    //fclose(stdout);
    //cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
    return 0;
}