A1113
Description:
给一组数,将它们划分成无交集的两个组,并且使这两组数量尽可能相等但总和差距尽可能大;
思路:
- 将数组排序,求出前缀和数组,再用结构体将所有划分方法的数量差和总和差存储、排序,输出最佳答案;
- 思路不如柳神清晰,传送门:柳婼:1113 Integer Set Partition
- “disjoint sets”这个条件其实数据没卡…侥幸通过了,(汗
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#include<string.h>
#include<algorithm>
#include<map>
#include<vector>
#include<queue>
using namespace std;
const int maxn = 1e5+5;
int n, num[maxn];
int sum[maxn];
struct no{
int dn, ds;
no(int a, int b){
dn = a;
ds = b;
}
};
bool cmp(no &a, no &b){
if(a.dn != b.dn) return a.dn < b.dn;
return a.ds > b.ds;
}
vector<no>ans;
int main()
{
#ifdef ONLINE_JUDGE
#else
freopen("1.txt", "r", stdin);
#endif // ONLINE_JUDGE
scanf("%d", &n);
for(int i = 0; i < n; i++)
scanf("%d", &num[i]);
sort(num, num+n);
for(int i = 0; i < n; i++){
if(i == 0)sum[i] = num[i];
else{
sum[i] = sum[i-1]+num[i];
}
}
for(int i = 0; i < n-1; i++){
ans.push_back(no(abs(n-2*i-2), abs(sum[n-1]-2*sum[i])));
}
sort(ans.begin(), ans.end(), cmp);
printf("%d %d\n", ans[0].dn, ans[0].ds);
return 0;
}