Pagini recente » Statistici Zamora Teodor (zamorateodor) | Cod sursa (job #382316) | Cod sursa (job #908053) | Cod sursa (job #1176346) | Cod sursa (job #933520)
Cod sursa(job #933520)
#include<fstream>
#include<algorithm>
#define NMAX 120005
#define x second
#define y first
#define TYPE pair <double,double>
using namespace std;
int n,l,s[NMAX];
TYPE v[NMAX];
void read()
{
ifstream fin("infasuratoare.in");
fin>>n;
for(int i=1;i<=n;i++)
fin>>v[i].x>>v[i].y;
fin.close();
}
void print()
{
ofstream fout("infasuratoare.out");
fout<<l<<'\n';
for(int i=l;i;i--)
fout<<fixed<<v[s[i]].x<<' '<<v[s[i]].y<<'\n';
fout.close();
}
inline double area(TYPE a,TYPE b,TYPE c)
{
return a.x * b.y + b.x * c.y + c.x * a.y -
b.x * a.y - c.x * b.y - a.x * c.y;
}
inline bool cmp(TYPE a,TYPE b)
{
return (area(v[1],a,b)<0);
}
void solve()
{
int poz=1;
for(int i=2;i<=n;i++)
if(v[i]<v[poz])
poz=i;
swap(v[1],v[poz]);
sort(v+2,v+n+1,cmp);
s[++l]=1;
s[++l]=2;
for(int i=3;i<=n;i++)
{
while(l>1 && area(v[s[l-1]],v[s[l]],v[i])>0)
l--;
s[++l]=i;
}
}
int main()
{
read();
solve();
print();
return 0;
}