hdu1171 Big Event in HDU(DP)
来源:互联网 发布:潮阳网店美工培训 编辑:程序博客网 时间:2024/05/16 11:12
题意:给出每个物体的价值和物体的数量,如何分使得A,B所得价值最接近并且A的价值不能小于B
思路:将总和平分后,就是一道01背包题了
#include <stdio.h>#include <string.h>#include <algorithm>using namespace std;int val[5005];int dp[255555];int main(){ int n,i,j,a,b,l,sum; while(~scanf("%d",&n),n>0) { memset(val,0,sizeof(val)); memset(dp,0,sizeof(dp)); l = 0; sum = 0; for(i = 0;i<n;i++) { scanf("%d%d",&a,&b); while(b--) { val[l++] = a; sum+=a; } } for(i = 0;i<l;i++) { for(j = sum/2;j>=val[i];j--) { dp[j] = max(dp[j],dp[j-val[i]]+val[i]); } } printf("%d %d\n",sum-dp[sum/2],dp[sum/2]); } return 0;}
0 0
- hdu1171 Big Event in HDU(DP)
- HDU1171 Big Event in HDU
- HDU1171--Big Event in HDU
- HDU1171 Big Event in HDU
- HDU1171 Big Event in HDU
- hdu1171 Big Event in HDU
- hdu1171 Big Event in HDU
- HDU1171-Big Event in HDU
- hdu1171 Big Event in HDU
- HDU1171 Big Event in HDU
- hdu1171 Big Event in HDU
- HDU1171-Big Event In HDU(母函数、动态规划)
- hdu1171 Big Event in HDU(典型多重背包)
- hdu1171 Big Event in HDU (01背包变形)
- hdu1171 Big Event in HDU(多重背包)
- hdu1171 Big Event in HDU(01背包)
- hdu1171 Big Event in HDU(多重背包)
- HDU1171 Big Event in HDU (母函数)
- iOS开发技巧:PCH文件的创建于使用
- 各种三方库,俱全
- Lucene对于索引的删改
- 条形码、二维码扫一扫和生成二维码采用ZXing3.0开源库在android studio中实现
- 1.asp.net mvc第一章 搭建mvc平台
- hdu1171 Big Event in HDU(DP)
- 发布mvc遇到的HTTP错误 403.14-Forbidden解决办法
- c# 执行javascript
- Tomcat7.0启动时出现如下错误java.lang.NoClassDefFoundError: org/apache/juli/logging/LogFactory
- dbvisualizer报错,NullPointerException
- Incorrect line ending: found carriage return (\r) without corresponding newline (\n)解决办法
- 又湿了
- QP
- 一起学Netty(十一)之 Netty心跳之IdleStateHandler