HDOJ 1712 ACboy needs your help (分组背包)
来源:互联网 发布:淘宝可以买凤楼信息吗 编辑:程序博客网 时间:2024/06/14 01:57
题目链接:。。。。。。。。。
题目大意:有n门功课用A[i][j]表示第i门功课花j天完成得到的profit, 给出m天, 要求在m天内得到的最大profit
状态方程:dp[j] = max(dp[j], dp[j-k]+A[i][k])
code:
#include <stdio.h>#include <string.h>int main(){ int i = 0, j = 0, k = 0, n = 0, m = 0, A[102][102], dp[102]; while(scanf("%d %d",&n, &m) , n != 0 && m != 0) { for(i = 1; i<=n; i++) for(j = 1; j<=m; j++) scanf("%d",&A[i][j]); memset(dp, 0, sizeof(dp)); for(i = 1; i<=n; i++) for(j = m; j>=0; j--)//天数 for(k = 1; k<=j; k++)//枚完成第i项作业的天数 dp[j] = dp[j]>dp[j-k]+A[i][k]? dp[j]:dp[j-k]+A[i][k]; printf("%d\n",dp[m]); } return 0;}
- HDOJ 1712 ACboy needs your help (分组背包)
- HDOJ 1712 ACboy needs your help(分组背包)
- HDOJ 1712 ACboy needs your help (分组背包)
- HDOJ 1712 ACboy needs your help(分组0/1背包)
- ACboy needs your help(分组背包)
- 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 1712ACboy needs your help 01背包(分组)
- hdu 1712 ACboy needs your help (分组背包)
- hdu 1712 ACboy needs your help(分组背包入门)
- HDU 1712 - ACboy needs your help(分组背包)
- HDU 1712 ACboy needs your help(分组背包)
- android开发中,项目里的文件不能导出到本地问题
- VMware Workstation - RAC的共享磁盘设置
- ORA-12514 TNS 监听程序当前无法识别连接描述符中请求服务 的解决方法
- Oracle 10G RAC - SYSAUX进行完全恢复的问题
- poj 2069 super star 模拟退火
- HDOJ 1712 ACboy needs your help (分组背包)
- poj 2420 A Star not a Tree? 模拟退火
- 如何高效地阅读技术类书籍与博客
- PL/Sql 连接数据库 超时问题解决
- Oracle 10G RAC与10G Physical DG 的测试-1
- Oracle 10G RAC与10G Physical DG 的测试-2
- ORA-12170 TNS 连接超时 .
- void在C/C++中的两种不同含义
- Oracle 10G RAC Clusterware Install ERROR:OCR integrity results are inconsistent amongst the nodes.