LA 3263 - That Nice Euler Circuit

这是刘汝佳训练指南上面的例题。

这是一道几何计算题目，在判断两个数是否相等的时候，使用了函数dcmp而不是直接==，原因是计算的精度会带来一定的误差，当一个数小于一定量的时候，就认为它是零，这样就允许了一定量的误差。unique函数可以将数组中重复的元素去掉，返回末尾元素的地址。

代码如下：

#include<iostream>
#include<stdlib.h>
#include<cmath>
#include<algorithm>
using namespace std;
const int maxn=350;

struct point{
	double x,y;
	point(double x=0,double y=0):x(x),y(y){}
};

typedef point vector;

vector operator + (vector a,vector b){return vector(a.x+b.x,a.y+b.y);}

vector operator - (vector a,vector b){return vector(a.x-b.x,a.y-b.y);}

vector operator * (vector a,double p){return vector(a.x*p,a.y*p);}

bool operator < (const point &a,const point &b){return a.x<b.x||(a.x==b.x&&a.y<b.y);}

int dcmp(double x){
	if(fabs(x)<=1e-10)return 0;
	return x<0 ? -1:1;
}

bool operator ==(const point &a,const point &b){
	return dcmp(a.x-b.x)==0&&dcmp(a.y-b.y)==0;
}

double dot(vector a,vector b){
	return a.x*b.x+a.y*b.y;
}
	
double cross(vector a,vector b){
	return a.x*b.y-a.y*b.x;
}

bool segmentproperintersection(point a1,point a2,point b1,point b2){
	double c1=cross(a2-a1,b1-a1),c2=cross(a2-a1,b2-a1),c3=cross(b2-b1,a1-b1),c4=cross(b2-b1,a2-b1);
	return dcmp(c1) * dcmp(c2) < 0 && dcmp(c3) * dcmp(c4) < 0 ;
}

bool onsegment(point p,point a1,point a2){
	return dcmp(cross(a1-p, a2-p))==0  && dcmp(dot(a1-p,a2-p)) < 0;
}

point getlineintersection(point p,vector v,point q,vector w){
	vector u=p-q;
	double t=cross(w,u)/cross(v,w);
	return p+v*t;
}

point V[maxn*maxn];
point P[maxn];
	
int main(){
	ios::sync_with_stdio(false);
//	freopen("data.txt","r",stdin);
	int n;
	int kase=0;
	while(cin>>n){
		if(n==0)break;
		for(int i=0;i<n;++i){
			cin>>P[i].x>>P[i].y;
			V[i]=P[i];
		}
		n--;
		int c=n,e=n;
		for(int i=0;i<n;++i){
			for(int j=i+1;j<n;++j){
				if(segmentproperintersection(P[i],P[i+1],P[j],P[j+1])){
					V[c++]=getlineintersection(P[i],P[i+1]-P[i],P[j],P[j+1]-P[j]);
				}
			}
		}
		sort(V,V+c);
		c=unique(V,V+c)-V;
	//	for(int i=0;i<c;++i){
	//		cout<<i<<' '<<V[i].x<<' '<<V[i].y<<endl;
	//	}
		for(int i=0;i<c;++i){
			for(int j=0;j<n;++j){
				if(onsegment(V[i],P[j],P[j+1])){
					e++;
				}
			}
		}
	//	cout<<c<<' '<<e<<endl;
		cout<<"Case "<<++kase<<": There are "<<e+2-c<<" pieces."<<endl;
	}
	return 0;
}