题意:给你n个点,判断是否能唯一确定一个凸包。即判断是否为稳定凸包
题解:
代码
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <vector>
using namespace std;
int const N = 1010;
struct Point
{
double x,y;
Point(){};
Point(double x,double y):x(x),y(y){};
Point operator - (const Point& e)const{
return Point(x - e.x,y - e.y);
}
bool operator < (const Point& e)const{
return x < e.x || (x == e.x && y < e.y);
}
};
Point p[N],ch[N];
double Cross(Point A,Point B){
return A.x * B.y - A.y * B.x;
}
int convex(Point* p,int n,Point* ch){
sort(p,p+n);
int m = 0;
for(int i=0;i<n;i++){
while(m > 1 && Cross(ch[m-1] - ch[m-2],p[i] - ch[m-2]) < 0) m--;
ch[m++] = p[i];
}
int k = m;
for(int i=n-2;i>=0;i--){
while(m > k && Cross(ch[m-1] - ch[m-2],p[i] - ch[m-2]) < 0) m--;
ch[m++] = p[i];
}
if(n > 1) m--;
return m;
}
bool solve(Point* p,int n){
for(int i=0;i<n;i++){
if(Cross(p[i] - p[(i-1+n)%n],p[(i+1)%n] - p[i]) && Cross(p[(i+1)%n] - p[i],p[(i+2)%n] - p[(i+1)%n]))
return false;
}
return true;
}
int main(){
int T,n;
scanf("%d",&T);
while(T--){
scanf("%d",&n);
for(int i=0;i<n;i++)
scanf("%lf%lf",&p[i].x,&p[i].y);
if(n < 6){
printf("NO\n");
continue;
}
int m = convex(p,n,ch);
if(solve(ch,m)) printf("YES\n");
else printf("NO\n");
}
return 0;
}