题意:给出3*k个数,每个数的范围为[0,1000]。要求将其分为3个长度为k的序列,使得至少有两个序列的和大于500*k。
思路:第一步的贪心比较好想,从大到小排序后后k个数舍弃不考虑。接下来的题意和双机调度(和poj2576题意也比较相近,不过那道题背包能过)有点像,就是让2k个数分成两份,每份k个数,使两组数之和尽可能相近。当然首先想用背包去做,但是一直WA(为啥不是tle呢??),于是看了题解原来是用随机才能过,思路见代码注释即可。背包能够求出两组数最相近的情况,复杂度比较高。而随机只要符合题意就退出循环,所以会比背包更快。
随机的AC代码:
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#define max(a,b) ((a)<(b)?(a):(b))
#define N 62
struct node{
int w,id;
}s[N*3],t1[N],t2[N],q;
using namespace std;
int n,sum1,sum2;
bool cmp(struct node a,struct node b){
return b.w < a.w;
}
int main(){
int i,j;
sum1 = sum2 = 0;
scanf("%d",&n);
for(i = 1;i<=3*n;i++){
scanf("%d",&s[i].w);
s[i].id = i;
}
sort(s+1,s+1+3*n,cmp);//先从大到小排序,后n个不取必可构成最优
for(i = 1;i<=2*n;i++){//将前2n个数分成两份,这样分能够让和尽量平均
if(i&1){
t1[i/2+1] = s[i];
sum1 += s[i].w;
}else{
t2[i/2] = s[i];
sum2 += s[i].w;
}
}
while(sum1<=500*n || sum2<=500*n){//如果没达到条件就交换
i = rand() % n + 1;
j = rand() % n + 1;
sum1 += (t2[j].w - t1[i].w);
sum2 += (t1[i].w - t2[j].w);
q = t1[i];
t1[i] = t2[j];
t2[j] = q;
}
for(i = 1;i<=n;i++)
printf("%d\n",t1[i].id);
for(i = 1;i<=n;i++)
printf("%d\n",t2[i].id);
for(i = 2*n+1;i<=3*n;i++)
printf("%d\n",s[i].id);
return 0;
}
背包的WA:
#include <cstdio>
#include <cstring>
#include <algorithm>
#define N 62
struct node{
int w,id;
}s[N*3];
int dp[60005],p[N*2][60005],res1[N],res2[N];
using namespace std;
int n,len1,len2;
bool cmp(struct node a,struct node b){
return a.w > b.w;
}
void print(int d,int x){
if(!d)
return;
if(p[d][x]){
print(d-1,x-s[d].w);
res1[len1++] = s[d].id;
}else{
print(d-1, x);
res2[len2++] = s[d].id;
}
}
int main(){
int i,j,sum=0;
scanf("%d",&n);
for(i = 1;i<=3*n;i++){
scanf("%d",&s[i].w);
s[i].id = i;
}
sort(s+1,s+3*n+1,cmp);
for(i = 1;i<=2*n;i++)
sum += s[i].w;
dp[0] = 0;
memset(p, 0, sizeof(p));
for(i = 1;i<=sum/2;i++)
dp[i] = n+1;
for(i = 1;i<=2*n;i++){
for(j = sum/2-s[i].w;j>=0;j--){
if(dp[j]<n){
if(dp[j+s[i].w] > dp[j]+1){
dp[j+s[i].w] = dp[j]+1;
p[i][j+s[i].w] = 1;
}
}
}
for(j = 0;j<s[i].w;j++)
p[i][j] = p[i-1][j];
}
for(i = sum/2;i>=0;i--)
if(dp[i] != n+1)
break;
len1 = len2 = 0;
print(2*n,i);
for(i = 0;i<len1;i++)
printf("%d\n",res1[i]);
for(i = 0;i<len2;i++)
printf("%d\n",res2[i]);
for(i = 2*n+1;i<=3*n;i++)
printf("%d\n",s[i].id);
return 0;
}