OJ Board

I get AC also with your hint.
Thanks.

I have considered "Edges of polygons intersect" and "vertexes of a polygon are in an other polygon", but still I got WA...
Could you give me some hint?

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

#define INF 20000

struct Point {
int x,y;

Point(int x, int y) : x(x), y(y ...

This is a faily easy problem if u consider a binary tree for finding the largest number
and the second largest number can also compute with the complesity of binary time

formula is
largest=n-1
second largest = lg2(n-1)
then sum the above two numbers

How to prove that it's minimum?

I got WA but don't know what wrong is.

input: my output: But in UVa toolkit, the output is: which ont is correct?

I used MST and I got AC.
But I haven't known why it works yet...

Can someone explain about it?

Can someone give me some hint on how to solve it?
Thanx in advance.