双重背包-- Jin Ge Jin Qu hao

题意 你在KTV还剩t秒钟的时间 你需要在n首歌中选择尽量多的歌使得歌的数量最多的前提下剩下的时间最小
至少要留一秒给劲歌金曲 所以是一个容量为t-1的01背包 d[i][j]表示恰用j秒时间在前i首歌中最多唱多少首 每个状态有两种选择 唱或不唱第i首歌
所以有转移方程d[i][j]=max(d[i-1][j],d[i-1][j-c[i]]+1)
关键是要输出曲数与时间两个量

#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
int dp[55][10578];
int time1[55][10578]; //用与dp同样的数组同步储存对应总时长time与头文件重名，改作time1                                   
int song[55];
int cnt = 0;
void DP(int n,int t)
{
    cnt++;
    for (int i = 1; i <= n;i++)
    for (int j = 0; j <= t;j++)            
    {
        if (j > song[i])
        {
            dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - song[i]] + 1);
            if (dp[i-1][j] == dp[i - 1][j - song[i]] + 1)
                time1[i][j] = max(time1[i - 1][j], time1[i - 1][j - song[i]] + 1);
            else if (dp[i][j] == dp[i - 1][j - song[i]] + 1)              /**///以下几处另time数组与dp数组同步递推
                time1[i][j] = time1[i - 1][j - song[i]] + song[i];
            else
                time1[i][j] = time1[i - 1][j];                      /**/
        }
        else                                                        /**/
        {
            dp[i][j] = dp[i - 1][j];
            time1[i][j] = time1[i - 1][j];                          
        }
    }
    cout << "Case " << cnt << ": " << dp[n][t] + 1 << " " << time1[n][t] + 678<<endl;
        return ;
}
int main()
{
    int T;
    cin >> T;
    while (T--)
    {
        int n, t;
        cin >> n >> t;
        for (int i = 1; i <= n; i++)
            cin >> song[i];
        DP(n,t);
    }
    return 0;
}