uva562 Dividing coins(背包)
2016-08-06 21:37
330 查看
思路:将它所给出的n个钱币加起来sum,将sum/2当作体积,求出在sum/2下的最大值,sum-2*dp[sum/2]
#include<iostream>
#include<stdio.h>
#include<string.h>
#include<math.h>
using namespace std;
#define max(x,y) (x>y? x:y)
int dp[100000],a[100000];
int main()
{
int text;
scanf("%d",&text);
while(text--)
{
int n;
scanf("%d",&n);
int i,sum=0;
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
sum+=a[i];
}
memset(dp,0,sizeof(dp));
for(i=1;i<=n;i++)
{
for(int j=sum/2;j>=a[i];j--)
dp[j]=max(dp[j],dp[j-a[i]]+a[i]);
}
//printf("%d\n",dp[sum/2]);
printf("%d\n",sum-2*dp[sum/2]);
}
return 0;
}
#include<iostream>
#include<stdio.h>
#include<string.h>
#include<math.h>
using namespace std;
#define max(x,y) (x>y? x:y)
int dp[100000],a[100000];
int main()
{
int text;
scanf("%d",&text);
while(text--)
{
int n;
scanf("%d",&n);
int i,sum=0;
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
sum+=a[i];
}
memset(dp,0,sizeof(dp));
for(i=1;i<=n;i++)
{
for(int j=sum/2;j>=a[i];j--)
dp[j]=max(dp[j],dp[j-a[i]]+a[i]);
}
//printf("%d\n",dp[sum/2]);
printf("%d\n",sum-2*dp[sum/2]);
}
return 0;
}
相关文章推荐
- Uva-562 Dividing coins (转换成01背包求解)
- UVA 562 Dividing coins (01背包基础)
- 【UVA-562】Dividing coins(背包)
- uva 562 Dividing coins (0/1背包)
- UVA 562 Dividing coins(DP:01背包)
- UVA 562 Dividing coins(01 背包问题)
- UVa 562 Dividing coins (0-1背包&等价转化)
- Dividing coins - UVa 562 dp背包
- uva562 - Dividing coins(简单动规)
- UVA - 562 Dividing coins (01背包)
- UVA 562 Dividing coins(01dp)
- uva 562 Dividing coins (01背包)
- Uva 562 Dividing coins
- UVA 562 【DP入门之01背包】
- UVA_562_Dividing coins
- uva 562 dividing coins
- Uva 562 0-1背包
- UVA 562 Dividing coins(01背包)
- UVa 562 Dividing coins(简单DP)
- uva562 - Dividing coins(01背包)