题目:
http://poj.org/problem?id=1228
题意:
给一堆点,是原凸包边上的点或内部的点(内部的点表明凸包被切割);
问能这些点能否唯一确定原来这个凸包
分析:
这是一个稳定凸包问题;
如果凸包上一条边唯一确定,那么这条边上至少要有3个点
所以,先跑一遍凸包,然后检查是否每条边至少有3个点;
用向量平行检查 ( 向量叉乘=0则三点共线 )
代码:
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
struct Point{
double x,y;
Point(double x=0,double y=0) :x(x),y(y) {}
Point operator + (Point p) {return Point(x+p.x,y+p.y);}
Point operator - (Point p) {return Point(x-p.x,y-p.y);}
Point operator * (double d){return Point(x*d,y*d);}
};
const double eps=1e-8;
int sgn(double x)
{
if(x>eps) return 1;
if(x<-eps) return -1;
return 0;
}
double cross(Point p1,Point p2) {return p1.x*p2.y-p2.x*p1.y;}
const int Tmax=1005;
bool cmp(Point i,Point j)
{
if(i.x<j.x) return true;
if(i.x>j.x) return false;
return i.y<j.y;
}
int convexHull(int n,Point *P,Point *aim)
{
int i,m=0;
sort(P+1,P+1+n,cmp);
for(i=1;i<=n;i++)
{
while(m>=2&&cross(aim[m]-aim[m-1],P[i]-aim[m-1])<0) m--;
aim[++m]=P[i];
}
int k=m;
for(i=n-1;i>=1;i--)
{
while(m>k&&cross(aim[m]-aim[m-1],P[i]-aim[m-1])<0) m--;
aim[++m]=P[i];
}
return m;
}
void check(int num,Point *aim)
{
int i=2,online=2;
//aim[++num]=aim[1];
while(i<=num)
{
while(i<num&&sgn(cross(aim[i]-aim[i-1],aim[i+1]-aim[i-1]))==0) i++,online++;
if(online<=2)
{
printf("NO\n");
return;
}
i++;
online=2;
}
bool ok=false;
for(i=3;i<=num;i++)
if(sgn(cross(aim[2]-aim[1],aim[i]-aim[1]))!=0)
{
ok=true;
break;
}
if(ok==false) printf("NO\n");
else if(sgn(cross(aim[num]-aim[num-2],aim[num-1]-aim[num-2]))!=0) printf("NO\n");
else printf("YES\n");
return;
}
void run(int n,int num,Point *aim,Point *P)
{
int i;
for(i=1;i<=n;i++)
printf("P:x=%.0lf y=%.0lf\n",P[i].x,P[i].y);
for(i=1;i<=num;i++)
printf("x=%.0lf y=%.0lf\n",aim[i].x,aim[i].y);
return;
}
int main()
{
int T,n,i,num;
Point P[Tmax],aim[Tmax];
scanf("%d",&T);
while(T--)
{
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%lf%lf",&P[i].x,&P[i].y);
num=convexHull(n,P,aim);
//run(n,num,aim,P);
check(num,aim);
}
return 0;
}