题意:把硬币分成两份,使两份尽量公平,求差值。
总和/2,使其中一个人的硬币尽量接近总和/2.
01背包问题
二维数组
#include<bits/stdc++.h>
#include<iostream>
#include<stdio.h>
#include<cstring>
#include<cstdlib>
using namespace std;
int dp[111][55555];
int v[111];
int main()
{
int t;
cin>>t;
while(t--)
{
int n,i,j;
cin>>n;
int sum = 0;
for(i=1; i<=n; i++)
{
scanf("%d",&v[i]);
sum +=v[i];
}
int res = sum/2;
memset(dp,0,sizeof(dp));
for(i=1; i<=n; i++)
{
for(j=0; j<=res; j++)
{
if(j<v[i])
dp[i][j] = dp[i-1][j];
else
dp[i][j] = max(dp[i-1][j],dp[i-1][j-v[i]]+v[i]);
}
}
printf("%d\n",sum-2*dp[n][res]);
}
return 0;
}
一位数组
#include<bits/stdc++.h>
#include<iostream>
#include<stdio.h>
#include<cstring>
#include<cstdlib>
using namespace std;
int dp[55555];
int v[111];
int main()
{
int t;
cin>>t;
while(t--)
{
int n,i,j;
cin>>n;
int sum = 0;
for(i=1; i<=n; i++)
{
scanf("%d",&v[i]);
sum +=v[i];
}
int res = sum/2;
memset(dp,0,sizeof(dp));
for(i=1; i<=n; i++)
{
for(j=res; j>=v[i]; j--)
{
dp[j] = max(dp[j],dp[j-v[i]]+v[i]);
}
}
printf("%d\n",sum-2*dp[res]);
}
return 0;
}