题意
把给定的数分成两部分,最多只能相差1个,使得他们的差最小。
思路
记得在UVa上有一题,分成两部分使得差最小,那直接对sum的一半进行背包即可,这题算是那题的升级版吧。
用dp[i][j][k]表示前i个选j个能否到达k,数据太大,滚一下。
又看到一种思路,先把输入分两部分存起来,然后用一个二重for,如果能够使相差减少就交换。
代码
#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define MP(a, b) make_pair(a, b)
const int MAXN = 200 + 10;
const int INF = 0x3f3f3f3f;
int w[MAXN];
bool dp[MAXN][MAXN * 40 + 10];
int main()
{
//freopen("input.txt", "r", stdin);
int n, i, j, sum = 0;
scanf("%d", &n);
for (i = 1; i <= n; i++)
{
scanf("%d", &w[i]);
sum += w[i];
}
dp[0][0] = 1;
for (i = 1; i <= n; i++)
for (j = n; j >= 1; j--)
for (int k = sum; k >= w[i]; k--)
dp[j][k] |= dp[j - 1][k - w[i]];
int t = sum >> 1;
n >>= 1;
for (i = t; i >= 0; i--)
if (dp[n][i])
{
printf("%d %d\n", i, sum - i);
return 0;
}
return 0;
}
#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define MP(a, b) make_pair(a, b)
const int MAXN = 200 + 10;
const int INF = 0x3f3f3f3f;
int w[MAXN], d[MAXN];
int main()
{
//freopen("input.txt", "r", stdin);
int n, i, j, asum = 0, bsum = 0, minmin = INF;
scanf("%d", &n);
for (i = 1; i <= n / 2; i++)
{
scanf("%d", &w[i]);
asum += w[i];
}
int t = n - n / 2;
for (i = 1; i <= t; i++)
{
scanf("%d", &d[i]);
bsum += d[i];
}
minmin = abs(asum - bsum);
for (i = 1; i <= n / 2; i++)
for (j = 1; j <= t; j++)
if (abs(bsum - asum + 2 * (w[i] - d[j])) < minmin)
{
asum += d[j] - w[i];
bsum += w[i] - d[j];
minmin = abs(asum - bsum);
swap(w[i], d[j]);
}
printf("%d %d\n", min(asum, bsum), max(asum, bsum));
return 0;
}