POJ 3246 Game convex hull games: N points are removed to obtain a set of N points, find the set of points constituting the convex hull of the minimum area? 3.6 Calculation dealing with plane and spatial geometry difficult to think of the convex hull points must be removed convex hull of the vertices, so water can 2000MS + past: #include <iostream> #include <vector> #include <algorithm> #include <cmath > using namesp ...
Continue reading : yard farm >> POJ 3246 Game problem solution "Challenge Programming Contest"
Original link : http://www.hankcs.com/program/algorithm/poj-3246-game.html
Reproduced in: https: //my.oschina.net/hankcs/blog/379979