Pagini recente » Cod sursa (job #1470105) | Cod sursa (job #2352127) | Cod sursa (job #2658328) | Cod sursa (job #3199310) | Cod sursa (job #2864509)
#include <iostream>
#include <fstream>
#include <algorithm>
#include <iomanip>
#define nmax 120005
using namespace std;
ifstream fin("infasuratoare.in");
ofstream fout("infasuratoare.out");
struct pcte{
float x,y;
}v[nmax];
pcte p0;
int n;
int lowest_y()
{
int x0=1;
for(int i=2;i<=n;i++)
if(v[i].y<v[x0].y ||
(v[i].y==v[x0].y && v[i].x<v[x0].x))
x0=i;
return x0;
}
int antiorar(pcte p0,pcte p1,pcte p2)//+p0
{
float prod=(p1.x-p0.x)*(p2.y-p0.y)-(p2.x-p0.x)*(p1.y-p0.y);
if(prod==0) return 0;
if(prod>0) return 1;//antiorar
return -1;//orar
}
bool cmp(pcte a,pcte b)
{
if(antiorar(p0,a,b)==1) return 1;
return 0;
}
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
fin>>v[i].x>>v[i].y;
int x0=lowest_y();
p0=v[x0];
swap(v[1],v[x0]);
sort(v+2,v+n+1,cmp);
int stk[nmax],k;
stk[1]=1; stk[2]=2; k=2;
for(int i=3;i<=n;i++)
{
while(k>1 && antiorar(v[stk[k-1]],v[stk[k]],v[i])==-1)
k--;
stk[++k]=i;
}
fout<<k<<endl;
for(int i=1;i<=k;i++)
fout<< fixed << setprecision(6) <<v[stk[i]].x<<' '<<v[stk[i]].y<<'\n';
return 0;
}