UVA 562 Dividing coins
2017-09-09 20:18
513 查看
题目链接:点击打开链接
01背包,给你几个硬币,分成两部分,是他们的和的差值尽量接近
从硬币总和的一半开始考虑
#include<iostream>
#include<cstdio>
#include<cstring>
#include<stack>
#include<algorithm>
using namespace std;
int dp[50010];
int num[1010];
int main(){
#ifndef ONLINE_JUDGE
freopen("in.txt","r",stdin);
#endif
int t;
cin>>t;
while(t--){
int n;
cin>>n;
int sum=0;
memset(dp,0,sizeof(dp));
for(int i=0;i<n;i++){
cin>>num[i];
sum+=num[i];
}
for(int i=0;i<n;i++){
for(int j=sum/2;j>=num[i];j--){
dp[j]=max(dp[j],dp[j-num[i]]+num[i]);
}
}
cout<<sum-2*dp[sum/2]<<endl;
}
}
01背包,给你几个硬币,分成两部分,是他们的和的差值尽量接近
从硬币总和的一半开始考虑
#include<iostream>
#include<cstdio>
#include<cstring>
#include<stack>
#include<algorithm>
using namespace std;
int dp[50010];
int num[1010];
int main(){
#ifndef ONLINE_JUDGE
freopen("in.txt","r",stdin);
#endif
int t;
cin>>t;
while(t--){
int n;
cin>>n;
int sum=0;
memset(dp,0,sizeof(dp));
for(int i=0;i<n;i++){
cin>>num[i];
sum+=num[i];
}
for(int i=0;i<n;i++){
for(int j=sum/2;j>=num[i];j--){
dp[j]=max(dp[j],dp[j-num[i]]+num[i]);
}
}
cout<<sum-2*dp[sum/2]<<endl;
}
}
相关文章推荐
- UVa 562 Dividing coins
- uva 562 Dividing coins
- UVA 562 Dividing coins
- uva 562Uva 562 Dividing coins
- UVa 562 - Dividing coins
- uva 562 - Dividing coins
- UVA 562 Dividing coins
- UVa 562 - Dividing coins
- UVALive5583 UVA562 Dividing coins【0/1背包+DP】
- uva 562 Dividing coins
- UVA 562 Dividing coins
- 0-1背包-uva562-Dividing coins
- uva 562 Dividing Coins
- UVA 562 Dividing coins
- uva 562 Dividing coins
- 动态规划 UVA - 562 Dividing coins
- UVa 562 Dividing Coins
- UVA - 562 Dividing coins
- UVA 562 Dividing coins【补充分析】
- UVA - 562 - Dividing coins (01背包)