BZOJ1249: SGU277 HERO 动态凸包【凸包+set】

1249: SGU277 HERO 动态凸包

我们只需要用一个set维护顺序。

#include<set>
#include<ctime>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
using namespace std;
typedef long long LL;
int n;double X,Y;LL Ans;
#include<cctype>
int read(){
	int ret=0;char ch=getchar();bool f=1;
	for(;!isdigit(ch);ch=getchar()) f^=!(ch^'-');
	for(; isdigit(ch);ch=getchar()) ret=(ret<<1)+(ret<<3)+ch-48;
	return f?ret:-ret;
}
struct Point{
	LL x,y;double Ang;
	LL operator *(const Point b)const{return x*b.y-y*b.x;}
	Point operator -(const Point b)const{return (Point){x-b.x,y-b.y};}
	bool operator <(const Point b)const{return Ang<b.Ang;}
}A,B,C;
set<Point> S;
typedef set<Point> ::iterator IT;
Point Pre(Point x){
	if(S.count(x)>0) return x;
	IT p=S.lower_bound(x);
	if(p==S.begin()) p=S.end();
	return *--p;
}
Point Nxt(Point x){
	IT p=S.upper_bound(x);
	if(p==S.end()) p=S.begin();
	return *p;
}
LL Cross(Point x,Point y,Point z){return (x-z)*(y-z);}
bool check(Point x){return Cross(x,Nxt(x),Pre(x))<=0;}
LL _abs(LL x){return x<0?-x:x;}
void Insert(Point x){
	if(check(x)) return;
	Ans+=_abs(Cross(x,Nxt(x),Pre(x)));
	while(1){
		Point p1=Pre(x),p2;
		S.erase(p1);p2=Pre(x);
		if(Cross(x,p2,p1)>=0){S.insert(p1);break;}
		Ans+=_abs(Cross(x,p2,p1));
	}
	while(1){
		Point p1=Nxt(x),p2;
		S.erase(p1);p2=Nxt(x);
		if(Cross(x,p2,p1)<=0){S.insert(p1);break;}
		Ans+=_abs(Cross(p1,p2,x));
	}
	S.insert(x);
}
int main(){
	srand(time(0));
//	freopen("1249.in","r",stdin);
//	freopen("1249.out","w",stdout);
	A=(Point){read(),read(),0};
	B=(Point){read(),read(),0};
	C=(Point){read(),read(),0};
	LL xx=rand(),yy=rand(),zz=rand(),tt=xx+yy+zz;
	X=1.0*(xx*A.x+yy*B.x+zz*C.x)/tt;
	Y=1.0*(xx*A.y+yy*B.y+zz*C.y)/tt;
	A.Ang=atan2(A.y-Y,A.x-X);
	B.Ang=atan2(B.y-Y,B.x-X);
	C.Ang=atan2(C.y-Y,C.x-X);
	S.insert(A),S.insert(B),S.insert(C);
	Ans=_abs(Cross(A,B,C));
	n=read();
	for(int i=1;i<=n;i++){
		int x=read(),y=read();
		Insert((Point){x,y,atan2(y-Y,x-X)});
		printf("%lld\n",Ans);
	}
	return 0;
}