|
||||
| The InvasionMemory limit: 32 MBAnd so it has come - the Triangles have invaded Byteotia! Byteotia lies on an island, occupying its entire surface. The shape of the island is a convex polygon (i.e. a polygon whose each inner angle is smaller than ). A certain number of software factories are located in Byteotia, each of which generates constant gains or losses. The Triangles have decided to occupy such a part of Byteotia which:
Byteasar, the King of Byteotia, is concerned by the amount of losses the Triangles' invasion could generate. Help him by writing a programme which shall calculate the sum of gains and losses generated by factories which the Triangles wish to capture. TaskWrite a programme which:
InputThe first line of the standard input contains a single integer (), denoting the number of vertices of the polygon-island. The following lines of the standard input contain two integers each and (), separated by a single space, denoting the coordinates and of consecutive vertices of the island, in a clockwise order. The -th line contains a single integer (), denoting the total number of factories. In each of the following lines there are three integers , and (, ), separated by single spaces, denoting: the coordinates and of the -th factory and the gain (for ) or loss (for ) this factory generates, respectively. Each factory is situated on the polygon-island i.e. within or on the border of it. Distinct factories may be located in the same place i.e. have the same coordinates. OutputThe first and only line of the standard output should contain a single integer denoting the maximal value of sum of all gains and losses generated by factories within a triangle whose vertices are three different vertices of the polygon-island. It may happen that the outcome is a negative integer. For the input data:5 4 1 1 4 8 9 11 5 8 1 4 7 2 3 6 3 -1 4 5 3 9 6 -4the correct outcome is: 5 Print friendly version |