//给定平面上的几个点 求某个矩形区域包含几个点

//要是点的坐标比较小 可以直接N^2的预处理 1的查询 对每次查询暴力当然也可以，但是适用性可以认为为0。。。

//这个算法不受点的坐标的影响 也不受矩形坐标的影响 效率为nlogn + mlogn n:点的个数 m:为查询次数

//先对数据已x坐标排序 ，这样可以二分出大致区间

//对于y坐标的处理（我上一年的时候直接暴力）， 昨天忽然灵感突现，用归并树保存x坐标排序后的数据的每段的y坐标序，然后再进行二分）

-//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)