Cod sursa(job #1689600)

Utilizator sorynsooSorin Soo sorynsoo Data 14 aprilie 2016 13:24:20
Problema Infasuratoare convexa Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 1.04 kb
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
#define MAXN 120005
ifstream cin("infasuratoare.in");
ofstream cout("infasuratoare.out");

struct pc
{
    double x, y;
}crt;

vector<pc> v;
int st[MAXN];
int n, nrSt;

double determinant(pc A, pc B, pc C)
{
    return (A.x - B.x)*(B.y - C.y) - (B.x - C.x)*(A.y - B.y);
}

bool cmp(pc A, pc B)
{
    return determinant( v[0], A, B) > 0;
}

int main()
{
    int i, mn = 0;
    cin >> n ;
    for(i=1; i<=n; i++)
    {
        cin >> crt.x >> crt.y;
        v.push_back( crt );
    }
    
    for(i=1; i<n; i++)
    {
        if( v[i].x < v[mn].x || ( v[i].x == v[mn].x && v[i].y < v[mn].y ) )
            mn = i;
    }
    
    swap(v[0], v[mn]);
    sort(v.begin() +1, v.end(), cmp);
    
    for(i=0; i<n; i++)
    {
        while( nrSt >=2 &&  determinant( v[ st[ nrSt-1] ], v[ st [ nrSt ]], v[i]) < 0)
            nrSt--;
        
        st[ ++nrSt ] = i;
    }
    
    cout<<nrSt<<"\n";
    for(i=1; i<=nrSt; i++)
        cout<<v[ st[i] ].x<<" "<<v[ st[i] ].y<<"\n";
    return 0;
}