Pagini recente » Cod sursa (job #141479) | Cod sursa (job #493271) | Cod sursa (job #123880) | Cod sursa (job #215768) | Cod sursa (job #2297208)
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#define pii pair <double, double>
#define x first
#define y second
#include <iomanip>
using namespace std;
ifstream fin ("infasuratoare.in");
ofstream fout ("infasuratoare.out");
pii v[120010];
int st[120010];
int n, top;
double det (pii a, pii b, pii c){
double ans = a.x * b.y + b.x * c.y + c.x * a.y - c.x * b.y - a.x * c.y - b.x * a.y;
return ans;
}
int main()
{
fin >> n;
for (int i=1; i<=n; i++){
fin >> v[i].x >> v[i].y;
}
sort (v+1, v + n + 1);
st[1] = 1;
st[2] = 2;
top = 2;
for (int i=3; i<=n; i++){
while (top >1 && det (v[st[top-1] ], v[ st[top] ], v[i] ) > 0)
top--;
st[++top] = i;
}
for (int i=n-1; i>=1; i--){
while (det (v[st[top-1] ], v[ st[top] ], v[i] ) > 0)
top--;
st[++top] = i;
}
fout << top - 1 << '\n';
for (int i=top-1; i>=1; i--)
fout << setprecision(6) << fixed << v[st[i]].x << ' ' << v[st[i]].y << '\n';
fin.close();
fout.close();
return 0;
}