第六讲 分组的背包问题 HDU 1712ACboy needs your help
来源:互联网 发布:nginx配置https证书 编辑:程序博客网 时间:2024/06/14 07:43
ACboy needs your help
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5618 Accepted Submission(s): 3063
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.
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 21 21 32 22 12 12 33 2 13 2 10 0
Sample Output
346
问题
有N件物品和一个容量为V的背包。第i件物品的费用是c[i],价值是w[i]。这些物品被划分为若干组,每组中的物品互相冲突,最多选一件。求解将哪些物品装入背包可使这些物品的费用总和不超过背包容量,且价值总和最大。
算法
这个问题变成了每组物品有若干种策略:是选择本组的某一件,还是一件都不选。也就是说设f[k][v]表示前k组物品花费费用v能取得的最大权值,则有:
f[k][v]=max{f[k-1][v],f[k-1][v-c[i]]+w[i]|物品i属于组k}
使用一维数组的伪代码如下:
for 所有的组k
for v=V..0
for 所有的i属于组k
f[v]=max{f[v],f[v-c[i]]+w[i]}
代码如下:#include<iostream>//c++#include<cmath>//数学公式#include<cstdlib>//malloc#include<cstring>#include<string>#include<cstdio>//输入输出#include<algorithm>//快排#include<queue>//队列#include<functional>//优先队列#include<stack>//栈#include<vector>//容器#include<map>//地图 if continuetypedef long long ll;const int N=105;using namespace std;int dp[N],value[N][N];int main(){// freopen("C:\\Users\\ch\\Desktop\\1.txt","r",stdin);//freopen("C:\\Users\\lenovo\\Desktop\\2.txt","w",stdout);int i,j,k;int v,n,m;while(cin>>m>>n,n|m) { for(i=0;i<m;i++) for(j=1;j<=n;j++) scanf("%d",&value[i][j]); memset(dp,0,sizeof(dp)); for(int i=0;i<m;i++) for(int j=n;j>=1;j--) for(int k=1;k<=j;k++) dp[j]=max(dp[j],dp[j-k]+value[i][k]); cout<<dp[n]<<endl; } return 0;}
0 0
- 第六讲 分组的背包问题 HDU 1712ACboy needs your help
- HDU 1712 ACboy needs your help (分组背包问题)
- HDU 1712(ACboy needs your help)分组背包问题
- HDU-1712 ACBoy needs your help (分组背包问题)
- ACboy needs your help hdu 分组背包问题
- hdu 1712 ACboy needs your help 分组背包
- hdu 1712 ACboy needs your help(分组背包入门题)
- HDU 1712 ACboy needs your help(分组背包)
- 【hdu 1712】ACboy needs your help (分组背包)
- hdu 1712 ACboy needs your help (分组背包)
- hdu 1712 ACboy needs your help(分组背包)
- hdu 1712 ACboy needs your help(分组背包)
- HDU 1712 ACboy needs your help ----分组背包
- hdu 1712 ACboy needs your help (分组背包)
- hdu 1712 ACboy needs your help(分组背包)
- HDU 1712 ACboy needs your help(DP 分组背包)
- hdu 1712 ACboy needs your help (分组背包)
- hdu 1712 ACboy needs your help(分组背包)
- MFC 的几个重绘
- C++历史段错误
- Spring-webmvc源码解析之ResourceHttpRequestHandler
- Valgrind使用简
- php7.0 + mysql5.7.10 + nginx7.0 web开发环境搭建(CentOS7)
- 第六讲 分组的背包问题 HDU 1712ACboy needs your help
- Node.js_Path模块
- go基本语法学习笔记之并发编程
- 多任务异步执行dispatch_group_async的使用
- Python中__init__方法使用
- Zookeeper 实现分布式功能组件
- 第七讲 有依赖的背包问题 vijos P1313金明的预算方案
- android 拨打特殊字符电话号码
- ListView优化机制及滑动时数据错乱