I love sneakers!
Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1895Accepted Submission(s): 764
Problem Description
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.
Input
Input contains multiple test cases. Each test case begins with three integers 1<=N<=100 representing the total number of products, 1 <= M<= 10000 the money Iserlohn gets, and 1<=K<=10 representing the sneaker brands. The following
N lines each represents a product with three positive integers 1<=a<=k, b and c, 0<=b,c<100000, meaning the brand’s number it belongs, the labeled price, and the value of this product. Process to End Of File.
Output
For each test case, print an integer which is the maximum total value of the sneakers that Iserlohn purchases. Print "Impossible" if Iserlohn's demands can’t be satisfied.
Sample Input
5 10000 3
1 4 6
2 5 7
3 4 99
1 55 77
2 44 66
Sample Output
Source
题意:
Iserlohn 要买运动鞋,商店总共有n双运动鞋Iserlohn喜欢,他总共有V元钱,这些运动鞋分为k类,没类都有自己的编号id,单价p,对Iserlohn的价值v。Iserlohn想每一类运动鞋至少买一双,在不超过他所拥有的总金额前提下,使他得到的v最大。
直接套模板 模板在我的日志
#include<stdio.h>
#include<string.h>
struct haha
{
int val;
int cost;
}a[15][105];
int val,cost,num[15],dp[12][10010];//数组dp[i][j],表示第i组,时间剩余为j时的价值
int mmax(int x,int y)
{
if(x>y) return x;
else return y;
}
int main()
{
int n,m,ki,k,i,j,flag,ans;
while(scanf("%d %d %d",&n,&m,&ki)!=EOF)
{
memset(num,0,sizeof(num));
memset(dp,0,sizeof(dp));
for(i=1;i<=n;i++)
{
scanf("%d %d %d",&flag,&cost,&val);
a[flag][num[flag]].cost=cost;
a[flag][num[flag]++].val=val;
}
for(i=1;i<=ki;i++)
{
for(j=0;j<=m;j++)
dp[i][j]=-1000000;
for(j=0;j<num[i];j++)
for(k=m;k>=a[i][j].cost;k--)
{
dp[i][k]=mmax(dp[i][k],dp[i][k-a[i][j].cost]+a[i][j].val);
dp[i][k]=mmax(dp[i][k],dp[i-1][k-a[i][j].cost]+a[i][j].val);
}
}
ans=dp[ki][m];
if(ans<=0) printf("Impossible\n");
else
printf("%d\n",ans);
}
return 0;
}
分享到:
相关推荐
杭电ACM课件2014版之 (HDUACM201303版_07)背包专题
HDU的1250,主要是利用高精度加法,但是代码有点繁琐,效率不是很高
杭电ACMhdu1163
HDU的一题........HDU DP动态规
HDU1059的代码
hdu1001解题报告
hdu 1574 passed sorce
这个是杭电hdu的一个分类,新手们可以按照这个来刷题!
hdu2101AC代码
hdu acm 教案 搜索入门 hdu acm 教案 搜索入门
HDU 1022 Train Problem I 附详细思路
搜索 dfs 解题代码 hdu1241
ACM HDU题目分类,我自己总结的大概只有十来个吧
hdu 5007 Post Robot 字符串枚举。 暴力一下就可以了。
hdu ACM代码 每种算法都有分类 大三了,没有时间弄ACM,这些要删了
hdu acm 教案 动态规划(1) hdu acm 教案 动态规划(1)
自己做的HDU ACM已经AC的题目
hdu 1166线段树代码
HDU最全ac代码
一个十分简单的程序,能够ac杭电hdu的第2050题,无注释,简单明了