poj 2318 TOYS（叉积+二分）

题意：一个很长的箱子，里面有n个隔板分成了n+1个小箱子，把m个玩具扔进这个n+1个小箱子，计算每个箱子有多少个玩具。(x1,y1) and (x2,y2)是左上角和右下角坐标。下边n行是每个隔板上下两个定点的x坐标，再下边m行是每个玩具的坐标。对隔板二分查找，叉积判断点在线的哪一侧。二分的时候边界的问题搞得我是很蛋疼，还看了下别人的二分

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

const int MAXN = 5010;
struct Point
{
    int x,y;
};
struct Line
{
    Point s,e;
};

Point p;
Line Lines[MAXN];
int book[MAXN];

int det(int x1, int y1, int x2, int y2)
{
    return x1*y2 - x2*y1;
}

void BinarySearch(Point P, int n)
{
    int mid,l,r,tmp;
    l = 0;
    r = n;
    while(l <= r)
    {
        mid = (l+r) >> 1;
        if(det(P.x-Lines[mid].e.x,P.y-Lines[mid].e.y,Lines[mid].s.x-Lines[mid].e.x,Lines[mid].s.y-Lines[mid].e.y) > 0) l = mid+1;
        else r = mid-1, tmp = mid;
    }
    book[tmp]++;
}


int main()
{
    int n,m,x1,y1,x2,y2,Ui,Li;
    while(scanf("%d",&n) && n)
    {
        memset(book,0,sizeof(book));
        scanf("%d %d %d %d %d",&m,&x1,&y1,&x2,&y2);
        for(int i = 0; i < n; ++i)
        {
            scanf("%d %d",&Ui,&Li);
            Lines[i].s.x = Ui;
            Lines[i].s.y = y1;
            Lines[i].e.x = Li;
            Lines[i].e.y = y2;
        }
        Lines[n].s.x = x2;
        Lines[n].s.y = y1;
        Lines[n].e.x = x2;
        Lines[n].e.y = y2;
        for(int i = 0; i < m; ++i)//玩具的点
        {
            scanf("%d %d",&p.x,&p.y);
            BinarySearch(p,n);
        }
        for(int i = 0; i <= n; ++i)
            printf("%d: %d\n",i,book[i]);
        printf("\n");
    }
    return 0;
}