hdu 3033 I love sneakers! 分组背包

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=3033

After months of hard working, Iserlohn finally wins awesome amount of scholarship. As a great zealot of sneakers, he decides to spend all his money on them in a sneaker store.

There are several brands of sneakers that Iserlohn wants to collect, such as Air Jordan and Nike Pro. And each brand has released various products. For the reason that Iserlohn is definitely a sneaker-mania, he desires to buy at least one product for each brand.
Although the fixed price of each product has been labeled, Iserlohn sets values for each of them based on his own tendency. With handsome but limited money, he wants to maximize the total value of the shoes he is going to buy. Obviously, as a collector, he won’t buy the same product twice.
Now, Iserlohn needs you to help him find the best solution of his problem, which means to maximize the total value of the products he can buy.

题意描述：有n个物品，多种品牌，每个产品有三个属性a,b和c，分别代表品牌种类、价钱和价值。现在你有现金m和k个伙伴，要求为每一位伙伴至少买一件物品，求出得到的最大价值（编号为u的伙伴只能得到品牌种类为u的物品）。

算法分析：分组背包。dp[i][j]代表前 i 种物品、身上有j元获得的最大价值。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<algorithm>
#include<vector>
#include<queue>
#define inf 0x7fffffff
using namespace std;
const int maxn=100+10;

int n,m,k;
int dp[12][10000+10];
vector<pair<int,int> > vec[maxn];

int main()
{
    while (scanf("%d%d%d",&n,&m,&k)!=EOF)
    {
        int a,b,c;
        for (int i=1 ;i<=n ;i++) vec[i].clear();
        for (int i=1 ;i<=n ;i++)
        {
            scanf("%d%d%d",&a,&b,&c);
            vec[a].push_back(make_pair(b,c));
        }
        memset(dp,-1,sizeof(dp));
        memset(dp[0],0,sizeof(dp[0]));
        int flag=0;
//        for (int i=1 ;i<=k ;i++)
//        {
//            int num=vec[i].size();
//            for (int j=0 ;j<num ;j++)
//                cout<<vec[i][j].first<<" "<<vec[i][j].second<<endl;
//            cout<<endl;
//        }
        for (int i=1 ;i<=k ;i++)
        {
            int num=vec[i].size();
            if (num==0) {flag=1;break; }
            for (int u=0 ;u<num ;u++)
            {
                int p=vec[i][u].first;
                for (int j=m ;j>=p ;j--)
                {

                    int value=vec[i][u].second;
                    if (dp[i][j-p]!=-1)
                    dp[i][j]=max(dp[i][j],dp[i][j-p]+value);
                    if (dp[i-1][j-p]!=-1)
                    dp[i][j]=max(dp[i][j],dp[i-1][j-p]+value);
                }
            }
        }
        if (flag || dp[k][m]==-1) printf("Impossible
");
        else printf("%d
",dp[k][m]);
    }
    return 0;
}