uva 562 dividing coins
2015-03-25 18:15
274 查看
解题思路:
把一些物品尽量的均分成俩分,问在尽量均分的情况下俩份相差多少解题思路:
0-1背包,将所有物品价值总和sum的一半作为背包容量进行递推即可,最后用sum-2*dp【sum/2】便可以求出答案;#include<cstdio> #include<cstring> #include<algorithm> using namespace std; int main() { int t; scanf("%d",&t); while(t--) { int n; int dp[100010]={0}; scanf("%d",&n); int cost[110]; int tem=0; for(int i=0;i<n;i++) { scanf("%d",&cost[i]); tem+=cost[i]; } int sum=tem/2; for(int i=0;i<n;i++) { for(int j=sum;j>=cost[i];j--) { dp[j]=max(dp[j],dp[j-cost[i]]+cost[i]); } } printf("%d\n",tem-2*dp[sum]); } }
相关文章推荐
- UVA 562 Dividing coins (01背包)
- Dividing coins - UVa 562 dp背包
- UVA 562 Dividing coins (01背包)
- UVa 562 Dividing coins (0-1背包&等价转化)
- UVA 562 Dividing coins 分硬币(01背包,简单变形)
- UVA_562_Dividing coins
- UVA 562 Dividing coins(dp + 01背包)
- uva 562 Dividing coins (01背包)
- 【UVA-562】Dividing coins(背包)
- Uva 562 Dividing coins
- Uva 562 Dividing coins(01背包问题)
- uva 562 Dividing coins(01背包)
- UVA - 562 Dividing coins (01背包)
- UVA 562 Dividing coins(01 背包问题)
- uva 562 Dividing coins 分钱 dp
- UVa 562 Dividing coins(简单DP)
- UVA 562 Dividing coins(dp + 01背包)
- UVA562 Dividing coins (01背包)
- UVA.562 Dividing coins (DP 01背包)
- UVA 562 Dividing coins(01dp)