#include <iostream>
#include <cmath>
#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn=1000;
const double eps=1e-8;
struct Point
{
double x,y;
Point(){}
Point(double _x,double _y)
{
x=_x;
y=_y;
}
Point operator -(const Point &b)const
{
return Point(x-b.x,y-b.y);
}
double operator ^(const Point &b)const
{
return x*b.y-y*b.x;
}
double operator *(const Point &b)const
{
return x*b.x+y*b.y;
}
};
Point p[maxn];
int Stack[maxn];
int top=0;
double dist(Point a,Point b)
{
return sqrt((a-b)*(a-b));
}
bool cmp(Point a,Point b)
{
double t=((a-p[0])^(b-p[0]));
if(t>0)
return true;
else if(t==0)
return dist(a,p[0])<dist(b,p[0]);
else
return false;
}
int gram(int n)
{
for(int i=0;i<n;i++)
{
if(p[i].x<p[0].x||(p[i].x==p[0].x&&p[i].y<p[0].y))
swap(p[0],p[i]);
}
sort(p+1,p+n,cmp);
Stack[0]=0;
Stack[1]=1;
top=1;
for(int i=2;i<n;i++)
{
if(((p[Stack[top]]-p[Stack[top-1]])^(p[i]-p[Stack[top-1]]))<0)
return -1;
top++;
Stack[top]=i;
}
return 1;
}
int main()
{
int n;
while(1)
{
cin>>n;
if(n==0)
break;
if(n<=2)
{
printf("concave\n");
}
else
{
for(int i=0;i<n;i++)
{
cin>>p[i].x>>p[i].y;
}
if(gram(n)==1)
printf("convex\n");
else
printf("concave\n");
}
}
return 0;
}
Shape of HDU HDU - 2108 凸包
最新推荐文章于 2021-08-21 20:21:02 发布