OJ Board

hahaha what a stupid mistake...

I need more I/O !

why

input

1 2
1 0
2 0

output

2.00000

??

Hi
there is anybody to help me??

Some I/O ??

But why WA.
this is my code

#include <iostream.h>
#include <stdlib.h>
#include <stdio.h>
#include <math.h>
#include <string.h>


typedef struct
{
long long x;
long long y;
}Point;

Point point[101];
Point p0;
long stack[101];
long long ps;
long ...

Just sweeping left to right is enough. Imagine a vertical line through each vertex. You get O(N) strips, and in each strip at most 4 edges => each strip can be processed in O(1) time. That's all.

Could you explain the process? step by step.. I cant figure out what I have to search in each strip ...

I have all the slopes in an STRUCT, so I want to sort them.. but I think that an n^2 algorithm is not the answer, so how can I sort an struct using qsort C++? or.. If you have another idea?