#include <iostream>
#include <string.h>
#include <stdio.h>
#include <algorithm>
#include <math.h>
using namespace std;
#define maxn 20000
int top = 2;
struct Point
{
double x,y,len;
}Pt[maxn],Stack[maxn],Point_A;
double Cross( Point a, Point b, Point c)
{
return (b.x - a.x)*(c.y - a.y) - (b.y - a.y)*(c.x - a.x);
}
double Dis(Point a, Point b)
{
return sqrt((a.x - b.x) * (a.x - b.x) + (a.y - b.y)*(a.y - b.y));
}
void FindPoint( int n)
{
int i,tempNumber = 0;
Point tempPoint ;
Point_A = Pt[1];
for( i = 1; i<=n; i++)
{
if(Pt[i].y < Point_A.y || Pt[i].y == Point_A.y &a
#include <string.h>
#include <stdio.h>
#include <algorithm>
#include <math.h>
using namespace std;
#define maxn 20000
int top = 2;
struct Point
{
double x,y,len;
}Pt[maxn],Stack[maxn],Point_A;
double Cross( Point a, Point b, Point c)
{
return (b.x - a.x)*(c.y - a.y) - (b.y - a.y)*(c.x - a.x);
}
double Dis(Point a, Point b)
{
return sqrt((a.x - b.x) * (a.x - b.x) + (a.y - b.y)*(a.y - b.y));
}
void FindPoint( int n)
{
int i,tempNumber = 0;
Point tempPoint ;
Point_A = Pt[1];
for( i = 1; i<=n; i++)
{
if(Pt[i].y < Point_A.y || Pt[i].y == Point_A.y &a