分组背包--hdu1712

发布时间:2016-12-10 9:38:47 编辑:www.fx114.net 分享查询网我要评论
本篇文章主要介绍了"分组背包--hdu1712",主要涉及到分组背包--hdu1712方面的内容,对于分组背包--hdu1712感兴趣的同学可以参考一下。

Online Judge Online Exercise Online Teaching Online Contests Exercise Author F.A.Q Hand In Hand Online Acmers Forum | Discuss Statistical Charts Problem Archive Realtime Judge Status Authors Ranklist        C/C++/Java Exams      ACM Steps Go to Job Contest LiveCast [email protected] STD Contests  VIP Contests  Virtual Contests      DIY | Web-DIY beta Recent Contests  lee  Mail 0(0)  Control Panel   Sign Out   ACboy needs your help Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3038    Accepted Submission(s): 1577 Problem Description ACboy has N courses this term, and he plans to spend at most M days on study.Of course,the profit he will gain from different course depending on the days he spend on it.How to arrange the M days for the N courses to maximize the profit?   Input The input consists of multiple data sets. A data set starts with a line containing two positive integers N and M, N is the number of courses, M is the days ACboy has. Next follow a matrix A[i][j], (1<=i<=N<=100,1<=j<=M<=100).A[i][j] indicates if ACboy spend j days on ith course he will get profit of value A[i][j]. N = 0 and M = 0 ends the input.   Output For each data set, your program should output a line which contains the number of the max profit ACboy will gain.   Sample Input 2 2 1 2 1 3 2 2 2 1 2 1 2 3 3 2 1 3 2 1 0 0   Sample Output 3 4 6 分组背包,每门课程看为一组,,花费的天数为费用 根据 for 所有的组k     for v=V..0         for 所有的i属于组k             f[v]=max{f[v],f[v-c[i]]+w[i]} 代码如下: #include<iostream> #include<algorithm> #include<cstring> #include<cstdio> using namespace std; int A[110][110]; int dp[110]; int main() { //freopen("in.txt","r",stdin); int n,m; while(cin>>n>>m,n||m) { for(int i=1; i<=n; i++) for(int j=1; j<=m; j++) cin>>A[i][j]; memset(dp,0,sizeof(dp)); for(int i=1; i<=n; i++) for(int j=m; j>0; j--) for(int k=1; k<=m; k++) if(j-k>=0) dp[j]=max(dp[j],dp[j-k]+A[i][k]); cout<<dp[m]<<endl; } return 0; }

上一篇:随便写了一些,练练SWING界面
下一篇:SilkTest FAQ 3

相关文章

相关评论