Circle Union
시간 제한2초메모리 제한256 MB
n개의 원을 배치해 한 점이 모든 원에 포함되도록 하면서, 적어도 한 원이 덮는 영역의 넓이를 최대로 구한다.
문제
An arrangement of several circles in the plane is interesting if there exists a point that lies inside or on the boundary of each circle. The covered region of an arrangement consists of all points that lie inside or on the boundary of at least one of the circle.
Consider circles of radii respectively. Find the largest possible area of the region covered by these circles in an interesting arrangement.
입력
The first line contains a single integer ().
The second line contains integers ().
출력
Print a single real number --- the largest possible covered area. Your answer will be considered correct if its absolute or relative error doesn't exceed .