HDU 1171 Big Event in HDU(01背包)
来源:互联网 发布:高仿买家退货淘宝介入 编辑:程序博客网 时间:2024/05/22 06:34
题目地址:HDU 1171
还是水题。。普通的01背包。注意数组要开大点啊。。。。
代码如下:
#include <iostream>#include <cstdio>#include <string>#include <cstring>#include <stdlib.h>#include <math.h>#include <ctype.h>#include <queue>#include <map>#include <set>#include <algorithm>using namespace std;int dp[260000], v[600], k[600], c[260000];int main(){ int n, i, j, y, z, sum, s, cnt, x; while(scanf("%d",&n)!=EOF) { if(n<0) break; sum=0; for(i=0;i<n;i++) { scanf("%d%d",&v[i],&k[i]); sum+=v[i]*k[i]; } memset(dp,0,sizeof(dp)); cnt=0; for(i=0;i<n;i++) { x=k[i]; y=1; while(x-y>=0) { c[cnt++]=y*v[i]; x-=y; y*=2; } if(x) c[cnt++]=x*v[i]; } s=sum; sum/=2; dp[0]=1; for(i=0;i<cnt;i++) { for(j=sum;j>=c[i];j--) { if(dp[j-c[i]]) dp[j]=1; } } int ans; for(i=sum;i>=0;i--) { if(dp[i]) { ans=i; break; } } printf("%d %d\n",s-ans,ans); } return 0;}
0 0
- HDU 1171 Big Event in HDU(01背包)
- hdu 1171 Big Event in HDU(01背包)
- HDU 1171 Big Event in HDU(01背包问题)
- HDU 1171 Big Event in HDU(01背包)
- hdu 1171 Big Event in HDU (01背包)
- HDU 1171 Big Event in HDU(01背包)
- HDU 1171 Big Event in HDU(01背包)
- hdu 1171 Big Event in HDU(01背包变形)
- HDU 1171 Big Event in HDU (DP--01背包)
- HDU 1171 Big Event in HDU(01背包)
- hdu-1171 Big Event in HDU(01背包)
- hdu 1171 Big Event in HDU(01背包&多重背包)
- [HDU 1171 Big Event in HDU]背包
- HDOJ 1171 Big Event in HDU(01背包)
- 杭电1171Big Event in HDU(01背包)
- hdu 1171 Big Event in HDU 01背包
- HDU--航但--1171--Big Event in HDU--01背包
- Big Event in HDU - HDU 1171 01背包
- jQuery Easy UI Tooptip(提示框)组件
- 九数码(康拓展开+BFS)
- 读书笔记---光耀生命
- poj 3321Apple Tree 树状数组
- 数字图像处理领域可以投稿的期刊
- HDU 1171 Big Event in HDU(01背包)
- UVa 11489 - Integer Game (简单博弈 脑筋急转弯)
- uvalive 6396 数论 世界决赛的题
- tinyxml使用
- 模拟退火算法
- 后缀数组模板(倍增法)
- TopCoder-BadNeighbours
- Android开发————Alarm学习笔记
- c# 截取字符串两特定字符中间的字符