Pagini recente » Cod sursa (job #826450) | Cod sursa (job #675410) | Cod sursa (job #2065581) | Borderou de evaluare (job #888933) | Cod sursa (job #2847154)
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("infasuratoare.in");
ofstream fout("infasuratoare.out");
struct point
{
long double x,y;
}v[120010],s[120010];
int f,n,i,poz;
long double ymin=1e9,xmin=1e9;
long double cp(point a,point b,point c)
{
return (b.x-a.x)*(c.y-a.y)-(b.y-a.y)*(c.x-a.x);
}
bool cmp(point a,point b)
{
return cp(v[1],a,b)>0; ///1
}
int main()
{
fin>>n;
for(i=1;i<=n;i++)
{
fin>>v[i].x>>v[i].y;
if(ymin>v[i].y)
{
poz=i;
ymin=v[i].y;
xmin=v[i].x;
}
else if(ymin==v[i].y && xmin>v[i].x)
{
v[i].x=xmin;
poz=i;
}
}
swap(v[1],v[poz]);
sort(v+2,v+n+1,cmp);
/*fout<<fixed<<setprecision(9);
for(i=1;i<=n;i++)
fout<<v[i].x<<" "<<v[i].y<<'\n';
fout<<'\n';*/
s[++f]=v[1];
s[++f]=v[2];
for(i=3;i<=n;i++)
{
while(f>=2 && cp(s[f-1],s[f],v[i])<0) ///2
f--;
s[++f]=v[i];
}
fout<<f<<'\n';
fout<<fixed<<setprecision(9);
for(i=1;i<=f;i++)
fout<<s[i].x<<" "<<s[i].y<<'\n';
return 0;
}
///La 1 si 2 tb semne inverse la comparare, se schimba din cauza sensului trigonometric pt afisare