poj1873---计算几何

//从1到n枚举，求砍到最少的树
//位压缩，之开始用的IDA*一直WA，遂换成位压缩果断AC
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<algorithm>
#define eps 1e-8
#define dist(a,b) sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y))
#define cross(a,b,c) (b.x-a.x)*(c.y-a.y)-(b.y-a.y)*(c.x-a.x)
#define dot(a,b,c) (b.x-a.x)*(c.x-a.x)+(b.y-a.y)*(c.y-a.y)
#define delt(a) fabs(a)<eps?0:a>0?1:-1
#define N 100
#define inf 1e20
using namespace std;
struct TPoint
{
    double x,y,vi,hi;
}pt[N],st;
int n,m,t,end;
int path[N],mid[N];
double minv,extra;
bool scan()//输入
{
	scanf("%d",&n);
	if(n==0) return 0;
	for(int i=0;i<n;i++)
	{
		scanf("%lf%lf%lf%lf",&pt[i].x,&pt[i].y,&pt[i].vi,&pt[i].hi);
	}
	return 1;
}
bool ncmp(TPoint a,TPoint b)
{
	int d1=delt(cross(st,a,b));
	return d1>0||(d1==0&&dist(st,a)<dist(st,b));
}
bool cmpx(TPoint a,TPoint b)
{
	return a.x<b.x||(a.x==b.x&&a.y<b.y);
}
double graham(TPoint cv[],int np)
{
	int i,k=0,j;
	double alh=0;
	sort(cv,cv+np,cmpx);
	st=cv[0];
	sort(cv,cv+np,ncmp);//内排序
	for(i=2,j=2;i<np;i++)//求凸包
	{
		while(j>1&&cross(cv[j-2],cv[j-1],cv[i])<=0) j--;
		cv[j++]=cv[i];
	}
	cv[j]=cv[0];
	for(i=0;i<j;i++)//求周长
		alh=alh+dist(cv[i],cv[i+1]);
	return alh;
}
void update(TPoint cv[],int np,double alv,double alh)
{
	double alp;
	if(alv-minv<-eps)
	{
		if(np==1||np==0) alp=0;
		else alp=graham(cv,np);//求剩下的树组成凸包的周长
		if(alh-alp>-eps)
		{
			minv=alv,extra=alh-alp;
			for(int i=0;i<n;i++) path[i]=mid[i];
		}
	}
}
void solve()
{
	minv=inf;
	int i,j,k,m=1<<n;
	double alv,alh;
	TPoint cv[N];
	memset(path,0,sizeof(path));
	for(t=1;t<m;t++)
	{
		alv=alh=0;
		for(i=j=k=0;i<n;i++)//记录要砍的树的价值和长度
		{
			k=1<<i;
			mid[i]=0;
			if(k&t) alv+=pt[i].vi,alh+=pt[i].hi,mid[i]=1;
			else cv[j++]=pt[i];
		}
		update(cv,j,alv,alh);
	}
	printf("Forest %d\n",end);
	printf("Cut these trees:");
	for(i=1;i<=n;i++) 
		if(path[i-1]) printf(" %d",i);
	puts("");
	printf("Extra wood: %.2f\n",extra);
}
int main()
{
	end=1;
    while(scan())
    {
		if(end!=1) puts("");
		solve();
		end++;
    }
    return 0;
}