Graphics This topic on the sort and binary search, and data size up to 10 ^ 8, so the choice of long -type array as a data structure. The idea of the algorithm is as follows: For the input x, y array, the first sort in order to form a line segment, and then, for each set of queries, binary search, the search process is as follows: The outer product of the vector, if the outer product is greater than 0 that the point above the line, is equal to 0 that the point in the line, otherwise the point below the line (of course while the query point to the mid+ Of the outer product to determine the exact location of the point). This binary search can find the location of the point. Finally, the output. Complexity: Because this problem is mainly used in the binary search to determine, so the complexity of O (mlogn). The spatial complexity is O (n).

5.cpp

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．