KPPOLY - Projections Of A Polygon
You are given a convex polygon on Cartesian coordinate system. It has projections on X and Y-axis. You can arbitrary rotate this polygon. What minimum and maximum sum of projections can you achieve?
First line contains one integer number N (3 ≤ N ≤ 100) - number of polygon's vertices. Following N lines contain vertex coordinates Xi and Yi. All numbers are integers. Vertices are given in clockwise or anticlockwise direction. No two vertices coincide. No three consecutive vertices lie on the same line. All coordinates do not exceed 10000 by absolute value.
Write minimum and maximum value of sum of the polygon's projections. Separate them by a space. Your answer should not differ with the correct one more than 10-6.
Input: 4 0 0 0 1 1 1 1 0 Output: 2 2.828427124
what does "minimum and maximum sum of projections" mean ?
The problem statement is unclear, as can be seen from its age, its one vote, and the few people who have attempted it. The single test case reveals nothing by providing a square. Please, at least provide two small but interesting examples. Unfortunately in this scheme, you cannot downvote a question until you have solved it.
first go AC!! :D
Precision matters a lot! Be careful about that
I have a question: the problem states that "You can arbitrary rotate this polygon."
|Added by:||Pavel Kuznetsov|
|Cluster:||Cube (Intel G860)|
|Languages:||ADA95 ASM32 BASH BF C CSHARP CPP C99 CLPS LISP sbcl LISP clisp D FORTRAN HASK ICON ICK JAVA LUA NEM NICE OCAML PAS-GPC PAS-FPC PERL PHP PIKE PRLG-swi PYTHON RUBY SCM qobi SCM guile ST WHITESPACE|