UVA 562 - Dividing coins
题目大意:给出n个硬币的面值, 要求将这n个硬币分成两堆(不要求个数平均), 尽量使得两堆硬币的和之差的绝对值最小, 病输出最小值的绝对值。
解题思路:将sum 总和的一半half看成是背包的容量, 然后进行01背包处理, 然后取尽量接近half的可达到值cur, half - cur 的两倍就是所要求的值ans, 注意一点, 当sum 为奇数的时候, ans 要加 1 。
#include <stdio.h>
#include <string.h>
const int N = 50005;
const int M = 105;
int n, sum, dp[N], coin[M], Max;
int solve() {
memset(dp, 0, sizeof(dp));
dp[0]= 1;
int half = sum / 2;
for (int i = 0; i < n; i++) {
for (int j = half - 1; j >= 0; j--)
if (dp[j]) dp[j + coin[i]] = 1;
}
for (int i = 0; i <= half; i++)
if (dp[half - i]) return i * 2;
}
int main() {
int cas;
scanf("%d", &cas);
while (cas--) {
sum = 0;
scanf("%d", &n);
memset(coin, 0, sizeof(coin));
for (int i = 0; i < n; i++) {
scanf("%d", &coin[i]);
sum += coin[i];
}
printf("%d\n", solve() + sum % 2);
}
return 0;
}
这个是昨天下午找到的。感觉比较好理解一些
#include <cstdio>
#include <iostream>
#include <cmath>
#include <cstring>
using namespace std;
#define min(a,b) ((a)<(b)?(a):(b))
const int maxn = 50005;
int main()
{
int n;
scanf("%d", &n);
while (n--)
{
int m, sum = 0, dp[maxn], coin[105];
int i, j;
scanf("%d", &m);
for (i=0; i<m; i++)
{
scanf("%d", &coin[i]);
sum += coin[i];
}
int mid = sum / 2;
memset(dp, 0, sum * sizeof(dp[0]));
for (i=0; i<m; i++)
{
for (j=sum; j>=coin[i]; j--)
{
if (abs(sum - 2*dp[j]) > abs(sum - 2*(dp[j-coin[i]] + coin[i])))
dp[j] = dp[j-coin[i]] + coin[i];
}
}
int min = 1e9;
for (i=0; i<=sum; i++)
if (min > abs(sum - 2*dp[i]))
min = abs(sum - 2*dp[i]);
printf("%d\n", min);
}
return 0;
}