分组背包变形(滚动数组）

Happy New Term!
As having become a junior, xiaoA recognizes that there is not much time for her to AC problems, because there are some other things for her to do, which makes her nearly mad.
What’s more, her boss tells her that for some sets of duties, she must choose at least one job to do, but for some sets of things, she can only choose at most one to do, which is meaningless to the boss. And for others, she can do of her will. We just define the things that she can choose as “jobs”. A job takes time , and gives xiaoA some points of happiness (which means that she is always willing to do the jobs).So can you choose the best sets of them to give her the maximum points of happiness and also to be a good junior(which means that she should follow the boss’s advice)?
InputThere are several test cases, each test case begins with two integers n and T (0<=n,T<=100) , n sets of jobs for you to choose and T minutes for her to do them. Follows are n sets of description, each of which starts with two integers m and s (0<m<=100), there are m jobs in this set , and the set type is s, (0 stands for the sets that should choose at least 1 job to do, 1 for the sets that should choose at most 1 , and 2 for the one you can choose freely).then m pairs of integers ci,gi follows (0<=ci,gi<=100), means the ith job cost ci minutes to finish and gi points of happiness can be gained by finishing it. One job can be done only once.OutputOne line for each test case contains the maximum points of happiness we can choose from all jobs .if she can’t finish what her boss want, just output -1 .

此题是背包问题分组问题加混合背包加变形（。。。）反正就是有点恶心，参考一位博主，研读之后明白背包问题的原理了终于。在最少选一个的情况下需要事先将时间都赋值为负无穷。然后便于此时间段内必至少选一个物品。f[i][k]=max(f[i][k],max(f[i-1][k-c[j]]+g[j],f[i][k-c[j]]+g[j])); 因为f[i][k]此时为负无穷，所以必须先选一个工作，然后去判断其他工作（每个时间都是如此）
1的情况就是最多选一个，这个就是分组背包的题了 f[i][k]=max(f[i][k],f[i-1][k-c[j]]+g[j]);（这样即可避免选到同一组的工作）要么选不选（即上一组的情况）要么选此工作（不会被同组工作所更新或更新本组其他工作）
2的情况就很像01背包了 f[i][k]=max(f[i][k],f[i][k-c[j]]+g[j]); 就是允许从本组进行更新，注意我所说的组是用 i 表示的

if(s==0)
{
   
for(int j=0;j<=t;j++)
    f[i][j]=-INF;
for(int j=1;j<=m;j++)
for(int k=t;k>=c[j];k--)
    f[i][k]=max(f[i][k],max(f[i-1][k-c[j]]+g[j],f[i][k-c[j]]+g[j]));
}
else</