Pagini recente » Cod sursa (job #339863) | Cod sursa (job #2987951) | Cod sursa (job #1533642) | Cod sursa (job #2602889) | Cod sursa (job #3149569)
#include <iostream>
#include <fstream>
#include <algorithm>
#include <iomanip>
using namespace std;
ifstream fin("infasuratoare.in");
ofstream fout("infasuratoare.out");
struct punct {
double x, y;
} v[120001], s[120001];
int n, varf;
double cross_product(punct A, punct B, punct C) {
return (B.x - A.x) * (C.y - A.y) - (B.y - A.y) * (C.x - A.x);
}
bool cmp(punct p1, punct p2) {
return cross_product(v[1], p1, p2) < 0;
}
int main() {
fin >> n;
for (int i = 1; i <= n; ++i)
fin >> v[i].x >> v[i].y;
int pos = 1;
for (int i = 2; i <= n; ++i)
if (v[i].x < v[pos].x)
pos = i;
swap(v[1], v[pos]);
sort(v + 2, v + n + 1, cmp);
s[1] = v[1];
s[2] = v[2];
varf = 2;
for (int i = 3; i <= n; ++i) {
while (varf >= 2 && cross_product(s[varf - 1], s[varf], v[i]) > 0)
--varf;
s[++varf] = v[i];
}
fout << fixed;
fout << varf << "\n";
for (int i = varf; i >= 1; --i)
fout << setprecision(9) << s[i].x << " " << s[i].y << "\n";
}