之前做过一道Ferry Loading III, 这题思路一开始就有:题目要求把n辆车放到船的两边,要求船的两边重量相差不得超过2%(实际上有不相差1%的解),先计算出重的那边最多能装多重的货物,设这个值为MAXW,然后在0到MAXW之间设置若干小区间,用类似0/1背包的方式进行DP。经过不断的叠加,终可以找到在可行范围内的解。我设置的可行范围是总重量的一半 到 总重量/1.985(设成1.98会WA)。
#include "iostream"
using namespace std;
struct node
{
int num,pre;
double weight;
}no[1009]; //区间数1000个
double rule[1009],dev;
int e,res;
double w[110],up,down;
bool place(int s)
{
int i,j,k = e;
double t;
for (i = 0; i < k;i++)
{
t = no[i].weight + w[s];
if (rule[(int)(t/dev)] == -1 && t <= up)
{
rule[(int)(t/dev)] = t;
no[e].num = s;
no[e].pre = i;
no[e++].weight = t;
if (t >= down)
{
res = e-1;
return true;
}
}
}
return false;
}
int main()
{
int i,j,k,n;
double sum;
no[0].num = -1;
no[0].weight = 0;
rule[0] = 0;
while (scanf("%d",&n) && n)
{
e = 1;
sum = 0;
for (i = 1;i <= n;i++)
{
scanf("%lf",&w[i]);
sum += w[i];
}
down = sum /2.01;//初始时可行区间的最大和最小值
up = sum /1.985; //
dev = sum/1000;
for (i = 1;i <= 1000;i++)
{
rule[i] = -1;
}
for (i = 1;i <= n;i++)//每次放入一辆车,扩大可行区间范围,直到找到解决方案
{
if(place(i)){
printf("%d",no[res].num);
i = no[res].pre;
while(i > 0)
{
printf(" %d",no[i].num);
i = no[i].pre;
}
printf("\n");
break;
}
}
}
return 0;
}