HDU 1171 Big Event in HDU(dp)
2014-03-21 00:08
337 查看
题目:
http://acm.hdu.edu.cn/showproblem.php?pid=1171
碎念:
看了题解后敲的,还不是很理解,先存着。
代码:
#include<stdio.h>
#include<string>
int dp[250005];
int a[5005];
int N;
int max(int a,int b)
{
if(a>b) return a;
else return b;
}
int min(int a,int b)
{
if(a<b) return a;
else return b;
}
int main()
{
while(~scanf("%d",&N))
{
if(N<=0) break;
int i,j;
int v,m;
int num=0;
int sum=0;
for(i=0;i<N;i++)
{
scanf("%d%d",&v,&m);
sum+=v*m;
for(j=0;j<m;j++)
{
a[num++]=v;
}
}
memset(dp,0,sizeof(dp));
for(i=0;i<num;i++)
{
for(j=sum/2;j>=a[i];j--)
{
dp[j]=max(dp[j],dp[j-a[i]]+a[i]);
}
}
printf("%d %d\n",max(dp[sum/2],sum-dp[sum/2]),min(dp[sum/2],sum-dp[sum/2]));
}
return 0;
}
http://acm.hdu.edu.cn/showproblem.php?pid=1171
碎念:
看了题解后敲的,还不是很理解,先存着。
代码:
#include<stdio.h>
#include<string>
int dp[250005];
int a[5005];
int N;
int max(int a,int b)
{
if(a>b) return a;
else return b;
}
int min(int a,int b)
{
if(a<b) return a;
else return b;
}
int main()
{
while(~scanf("%d",&N))
{
if(N<=0) break;
int i,j;
int v,m;
int num=0;
int sum=0;
for(i=0;i<N;i++)
{
scanf("%d%d",&v,&m);
sum+=v*m;
for(j=0;j<m;j++)
{
a[num++]=v;
}
}
memset(dp,0,sizeof(dp));
for(i=0;i<num;i++)
{
for(j=sum/2;j>=a[i];j--)
{
dp[j]=max(dp[j],dp[j-a[i]]+a[i]);
}
}
printf("%d %d\n",max(dp[sum/2],sum-dp[sum/2]),min(dp[sum/2],sum-dp[sum/2]));
}
return 0;
}
相关文章推荐
- hdu 1171(Big Event in HDU) (dp)
- 【HDU 1171】【背包DP 或者 母函数】Big Event in HDU【有n样物品,每样物品价值是v,件数是m。尽量把这些物品分成两堆使得两边总价值最接近】
- hdu 1171 Big Event in HDU 费用可行性背包 dp
- hdu 1171 Big Event in HDU(dp 01背包 母函数)
- HDU 1171 Big Event in HDU(母函数||DP)
- hdu 1171 Big Event in HDU(背包DP)
- HDU 1171 Big Event in HDU(DP)
- HDU 1171 Big Event in HDU (DP--01背包)
- HDU 1171 Big Event in HDU(DP)
- 暑期dp46道(32)--hdoj 1171 Big Event in HDU 多重背包:
- hdu 1171 Big Event in HDU dp
- Big Event in HDU 【HDOJ-1171-母函数】
- 1171 Big Event in HDU
- HDU 1171 Big Event in HDU 动态规划多重背包
- 动态规划J - Big Event in HDU HDU - 1171
- hdu 题目1171 Big Event in HDU(母函数及其应用)
- HDU1171 Big Event in HDU 01背包 母函数 TWT Tokyo Olympic 2COMBO-1 未完待续
- HDU 1171 Big Event in HDU (多重背包)
- HDOJ 1171 Big Event in HDU(01背包)
- HDU 1171 Big Event in HDU