自己凭着机房神犇的讲解写的求凸包~~~~到现在才写。。。太弱了
仅是自己的纪念~~~不要炒啊~~~(复杂度方面不保证优)
<span style="font-size:24px;">#include<cstdio>
#include<iostream>
#include<cstring>
#include<queue>
#include<vector>
#include<algorithm>
#define MAXN 200000
using namespace std;
int n;
int Tup[MAXN];
int length;
struct Node{
double x,y;
int id;
Node (double _,double __): x(_),y(__)
{}
Node () {}
void Read()
{
scanf("%lf%lf",&x,&y);
}
bool operator < (const Node &a)const
{
if(x!=a.x) return x<a.x;
return y<a.y;
}
Node operator -(const Node &a)
{
Node p;
p.x=x-a.x,p.y=y-a.y;
return p;
}
}p[MAXN];
struct que
{
int q[MAXN],l;
}que1,que2;
bool Is(Node a,Node b,Node c)
{
Node p1=a-b,p2=c-b;
if(p1.x*p2.y-p1.y*p2.x>0) return true;
else
return false;
}
int Make_<span style="color: rgb(51, 51, 51); font-family: arial; font-size: 24px; line-height: 24px; white-space: nowrap;">Tubag</span>()
{
sort(p+1,p+n+1);que1.q[1]=1;
int r=1;
for(int i=2;i<=n;i++)
{
while(r>=2&&Is(p[que1.q[r-1]],p[que1.q[r]],p[i]))
{
r--;
}
que1.q[++r]=i;
}
que1.l=r;
que2.q[1]=n;
r=1;
for(int i=n-1;i>=1;i--)
{
while(r>=2&&Is(p[que2.q[r-1]],p[que2.q[r]],p[i]))
{
r--;
}
que2.q[++r]=i;
}
que2.l=r;;
for(int i=1;i<que1.l;i++)
Tup[++length]=p[que1.q[i]].id;
for(int i=1;i<que2.l;i++)
Tup[++length]=p[que2.q[i]].id;
return length;
}
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
p[i].Read(),p[i].id=i;
int ans=Make_<span style="color: rgb(51, 51, 51); font-family: arial; font-size: 24px; line-height: 24px; white-space: nowrap;">Tubag</span>();
printf("%d\n\n",ans);
for(int i=1;i<=length;i++)
printf("%d\n",Tup[i]);
return 0;
}
</span>