uva12563 jin ge jin qu hao

(If you smiled when you see the title, this problem is for you ^_^ )
For those who don’t know KTV, see:
http://en.wikipedia.org/wiki/Karaoke_box There is one very popular
song called Jin Ge Jin Qu(). It is a mix of 37 songs, and is extremely
long (11 minutes and 18 seconds) | I know that there are Jin Ge Jin Qu
II and III, and some other unofficial versions. But in this problem
please forget about them. Why is it popular? Suppose you have only 15
seconds left (until your time is up), then you should select another
song as soon as possible, because the KTV will not crudely stop a song
before it ends (people will get frustrated if it does so!). If you
select a 2-minute song, you actually get 105 extra seconds! ….and if
you select Jin Ge Jin Qu, you’ll get 663 extra seconds!!! Now that you
still have some time, but you’d like to make a plan now. You should
stick to the following rules: • Don’t sing a song more than once
(including Jin Ge Jin Qu). • For each song of length t , either sing
it for exactly t seconds, or don’t sing it at all. • When a song is
nished, always immediately start a new song. Your goal is simple: sing
as many songs as possible, and leave KTV as late as possible (since we
have rule 3, this also maximizes the total lengths of all songs we
sing) when there are ties. Input The rst line contains the number of
test cases T ( T 100). Each test case begins with two positive
integers n , t (1 n 50, 1 t 10 9 ), the number of candidate
songs (BESIDES Jin Ge Jin Qu) and the time left (in seconds). The next
line contains n positive integers, the lengths of each song, in
seconds. Each length will be less than 3 minutes | I know that most
songs are longer than 3 minutes. But don’t forget that we could
manually \cut” the song after we feel satis ed, before the song ends.
So here \length” actually means \length of the part that we want to
sing”. It is guaranteed that the sum of lengths of all songs
(including Jin Ge Jin Qu) will be strictly larger than t . Output For
each test case, print the maximum number of songs (including Jin Ge
Jin Qu), and the total lengths of songs that you’ll sing. Explanation:
In the rst example, the best we can do is to sing the third song (80
seconds), then Jin Ge Jin Qu for another 678 seconds. In the second
example, we sing the rst two (30+69=99 seconds). Then we still have
one second left, so we can sing Jin Ge Jin Qu for extra 678 seconds.
However, if we sing the rst and third song instead (30+70=100
seconds), the time is already up (since we only have 100 seconds in
total), so we can’t sing Jin Ge Jin Qu anymore!

虽然题上写的是t<=10^9，但是由于t<所有曲子总长度，所以实际上数据范围到不了这么大【真是一道烂题】。于是时间和空间可以承受，用01背包即可。注意还要判断一下每个位置是不是能取到（因为要问长度，也就是问背包的实际容量）。
注意样例2，所以实际上t要减去1。

#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;
const int len=678;
int a[55],dp[10010];
bool ok[10010];
int main()
{
    int i,j,k,l,m,n,p,q,x,y,z,T,K,ans,pos,t;
    scanf("%d",&T);
    for (K=1;K<=T;K++)
    {
        memset(dp,0,sizeof(dp));
        memset(ok,0,sizeof(ok));
        scanf("%d%d",&n,&t);
        t--;
        for (i=1;i<=n;i++)
          scanf("%d",&a[i]);
        ok[0]=1;
        ans=pos=0;
        for (i=1;i<=n;i++)
          for (j=t;j>=a[i];j--)
            if (ok[j-a[i]])
            {
                ok[j]=1;
                dp[j]=max(dp[j],dp[j-a[i]]+1);
                if (dp[j]>ans||(dp[j]==ans&&j>pos))
                {
                    ans=dp[j];
                    pos=j;
                }
            }
        printf("Case %d: %d %d\n",K,ans+1,pos+len);
    }
}