z-chicken
Little Z decided to grow some chicken. For that he needs as big area as possible.
He know that in the woods near his house some trees are connected with fences, but no two fences intersect! He wants to know what is the biggest connected area that is surrounded by fences in the woods. Meaning, you can walk from any point in the area to any other point without crossing a fence.
That means, you have to calculate the area of that biggest area!
InputFrom the first line of the standard input read two integers N. 2 <= N <= 1000, and 1 <= M <= 100000. N is the number of trees in the woods, and M is the number of fences. From the next N lines read two integers a and b (each will be in the interval [-1000000 1000000], representing the coordinates of the corresponding tree. Finally from the next M lines read two integers [
] and d, that means there is a fence connecting the tree c and the tree d. The trees are zero indexed!OutputTo the standard input write one number with two decimal points precision representing the size of the biggest area surrounded by fence
Input:
[c]7 8
0 0
1 0
2 0
0 1
1 1
0 2
2 2
0 1
1 2
0 3
3 4
1 4
3 5
5 6
2 6Output:
[c]7 8
0 0
1 0
2 0
0 1
1 1
0 2
2 2
0 1
1 2
0 3
3 4
1 4
3 5
5 6
2 6Output:
3.00Submit solution
Coming laterThe grading service will be connected in a later migration step. You can inspect the task and your previous results now.