劲歌金曲

劲歌金曲

0-1背包

#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;

const int JGJQ=11*60+18;
const int maxn=50,maxt=(maxn*3*60)+JGJQ+1;

int t[maxn+1],f[maxn+1][maxt],g[maxn+1][maxt];

int main()
{
    int n,T,x,cnt=1;
    scanf("%d",&x);
    while(cnt<=x)
    {
        scanf("%d %d",&n,&T);
        for(int i=1; i<=n; i++)scanf("%d",&t[i]);

        memset(f, 0, sizeof(f));
        memset(g, 0, sizeof(g));
        
        for(int i=1; i<=n; i++)
            for(int time=1; time<=T; time++)
                if(time>t[i])
                {
                    if(f[i-1][time] < f[i-1][time-t[i]]+1)
                    {
                        f[i][time]=f[i-1][time-t[i]]+1;
                        g[i][time]=g[i-1][time-t[i]]+t[i];
                    }
                    else if(f[i-1][time] == f[i-1][time-t[i]]+1)
                    {
                        f[i][time]=f[i-1][time];
                        g[i][time]=max(g[i-1][time],g[i-1][time-t[i]]+t[i]);
                    }
                    else
                    {
                        f[i][time] = f[i - 1][time];
                        g[i][time] = g[i - 1][time];
                    }
                }
                else
                {
                    f[i][time] = f[i - 1][time];
                    g[i][time] = g[i - 1][time];
                }
        printf("Case %d: %d %d\n", cnt++, f[n][T] + 1, g[n][T] + JGJQ);
              //Case 1: 2 758
    }
    return 0;
}