题目链接: 点击打开链接
题目大意: 一堆硬币两个人分,要求差值最小
思路: 动态规划,01背包
分析:
01背包,把所有硬币面值相加除2得中值,把这个中值当成背包容量,算出在不超过它的情况下最多能拿多少钱,最后用总额减一下就成了。
代码:
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <memory.h>
using namespace std;
const int maxm = 100 + 10;
const int maxc = 50000 + 10;
int m, half, coins[maxm], dp[maxc];
void solve()
{
memset(dp, 0, sizeof(dp));
for (int i = 1; i <= m; ++i)
for (int j = half; j >= 1; --j)
if (j >= coins[i])
dp[j] = max(dp[j - coins[i]] + coins[i], dp[j]);
}
int main()
{
int t;
scanf("%d", &t);
while (t--)
{
scanf("%d", &m);
int sum = 0;
for (int i = 1; i <= m; ++i) {
scanf("%d", &coins[i]);
sum += coins[i];
}
half = sum / 2;
solve();
printf("%d\n", abs(sum - 2 * dp[half]));
}
return 0;
}