【洛谷P2409】Y的积木

这是一道dp……

f [ i ] [ j ] 表示前 i 组，总和为 j 时的方案数

f [ i ] [ j + a [ i ] [ k ] ] <-- f [ i - 1 ] [ j ]

#include<cstdio>
#include<cstring>
#include<algorithm> 
using namespace std;
const int N=105,M=11000;
int f[N][M],a[N][N],maxl[N],maxn,n,Q;
int main(){
    maxn=0;
    scanf("%d %d",&n,&Q);
    for (int i=1;i<=n;i++){
        scanf("%d",&a[i][0]);
        for (int j=1;j<=a[i][0];j++){
            scanf("%d",&a[i][j]);
            if (a[i][j]>maxl[i])
                maxl[i]=a[i][j];
        }
        maxn+=maxl[i];
        sort(a[i]+1,a[i]+a[i][0]+1);
    }
    for (int i=1;i<=a[1][0];i++)
        f[1][a[1][i]]++;//初始化不能赋成1 
    for (int i=2;i<=n;i++)
        for (int j=1;j<=maxn;j++){
            if (!f[i-1][j])
                continue;
            for (int k=1;k<=a[i][0];k++)
                f[i][j+a[i][k]]+=f[i-1][j];
        }
    int p=1,j=0;
    while (p<=Q){
        j++;
        for (int i=1;i<=f[n][j];i++){
            if (p>Q) return 0;
            printf("%d ",j);
            p++;
        }
    }
    return 0;
}