Introduction - If you have any usage issues, please Google them yourself
//Given a few points on the plane seeking a rectangular area contains several points// if the coordinates of the point is relatively small direct N ^ 2 pretreatment 1 course each query violence, but the applicability It can be considered as 0. . .// The coordinates of this algorithm from point not affect the efficiency of the rectangular coordinates nlogn+ m log n n: number of points m: as the number of queries// first sort data x coordinate, so two approximate interval is separated// y coordinate processing (direct violence) of the previous year when, yesterday, all of a sudden inspiration came, the y coordinate of the sequence of each segment of the x coordinate of the sort of data saved by merging tree, then two points)