Saint John Festival
题目链接：
http://acm.hust.edu.cn/vjudge/contest/127406#problem/J
Description
``` Porto’s Festa de São João is one of Europe’s liveliest street festivals. Its peak is the night of 23rd to 24th of June, with dancing parties from Ribeira to Foz all night long. Time to celebrate, with friends, relatives, neighbours or simply with other people in streets, armed with colored plastic hammers, huge garlic flowers or a bunch of lemongrass to gently greet passers-by. Fireworks, grilled sardines, barbecues, bonfires, potted basil plants (manjericos) and the sky covered by incandescent sky lanterns (balões de S.João) launched from every corner make this party unique. The sky lanterns are made of thin paper and cannot be released until they are filled in with hot air. Sometimes they burn out still on ground or on the way up, if a sudden gust of wind catches them. For this reason, the successful launchers usually follow the movement of their sky lanterns, with a mixture of anxiety and joy, for as long as they can distinguish them in the sky. We are not aware of any attempt to achieve a Guinness record of sky lanterns launched simultaneously (it could be dreadful night for firemen if there were). Can you imagine, thousands of people preparing their sky lanterns for release at the city park, within a region of larger ones that will be launched simultaneously? The large sky lanterns can be used to identify their positions in the sky afterwards, in order to count the surviving ones at an observation instant. Given the positions of the large sky lanterns and the positions of the small ones, determine the number of small sky lanterns that are in the interior or on the boundary of some triangle defined by any three of the large ones. ```Input
The input file contains several test cases, each of them as described below. The first line has an integer L that defines the number of the large sky lanterns at the observation instant. Each of the following L lines contains a pair of integers separated by a space that gives the coordinates (x, y) of a large sky lantern. After that, there is a line with an integer S that defines the number of small sky lanterns and S lines, each defining the position of a small sky lantern. The height is irrelevant for us. All the given points are distinct and there are at least three points representing large sky lanterns that are not collinear.Output
For each test case, the output has a single line with the number of small sky lanterns that are in the interior or on the boundary of some triangle defined by any three of the large sky lanterns. Constraints: 3 ≤ L ≤ 10 000 Number of large sky lanterns. 1 ≤ S ≤ 50 000 Number of small sky lanterns. 0 ≤ x, y ≤ 2 30 Bounds for coordinates. Note: The picture on the right illustrates the sample input belowSample Input
8 3 4 2 8 5 4 1 8 4 7 3 10 11 2 7 3 6 5 12 3 7 3 3 4 5 0 4 2 6Sample Output
3##题意： 在平面上给出若干个"大点"和"小点". 求有多少个小点满足：在任一由三个大点组成的三角形的内部或边界上.
##题解： 看图很容易看出要求一个凸包(证明也很容易). 然后依次判断各点是否在凸包内或边界上. 需要注意的是： 用longlong代替double参与运算，避免精度误差. 由于数据规模的限制，判断点是否在凸多边形内时要用O(logn)的算法. 以下代码用了二分法.
##代码： ``` cpp #include