poj2398Toy Storage

http://poj.org/problem?id=2398

跟2318一样 数据还少些 直接枚举的 2318还用了二分 叉积判左右

#include <iostream>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<stdlib.h>
#include<algorithm>
#include<cmath>
using namespace std;
struct pointt
{
    double x1,x2,mi,ma;
}p[1010];
int num[1010],co[1010];
bool cmp(pointt a,pointt b)
{
    if(a.ma==b.ma)
    return a.mi<b.mi;
    return a.ma<b.ma;
}
int cross(pointt a,pointt b)
{
    if((a.x1*b.x2-a.x2*b.x1)>0)
    return 1;
    return 0;
}
int main()
{
    int i,j,k,n,m;
    double x1,y1,x2,y2,x,y;
    while(cin>>n)
    {
        if(n==0)
        break;
        memset(num,0,sizeof(num));
        memset(co,0,sizeof(co));
        cin>>m;
        cin>>x1>>y1>>x2>>y2;
        for(i = 1; i <= n ; i++)
        {
            cin>>p[i].x1>>p[i].x2;
            p[i].ma = max(p[i].x1,p[i].x2);
            p[i].mi = max(p[i].x1,p[i].x2);
        }
        p[n+1].x1 = x2;
        p[n+1].x2 = x2;
        p[n+1].ma = p[n+1].mi = x2;
        sort(p,p+n+2,cmp);
        for(i = 1; i <= m ; i++)
        {
            cin>>x>>y;
            for(j = 1 ; j <= n+1 ; j++)
            {
                pointt a,b;
                a.x1 = p[j].x1-p[j].x2;
                a.x2 = y1-y2;
                b.x1 = x-p[j].x2;
                b.x2 = y-y2;
                if(cross(a,b))
                {
                    num[j]++;
                    break;
                }
            }
        }
        cout<<"Box\n";
        for(j = 1 ; j <= n+1 ;j++)
            if(num[j])
                co[num[j]]++;
        for(j = 1 ; j <= n+1 ;j++)
        {
            if(co[j])
            cout<<j<<": "<<co[j]<<endl;
        }
    }
    return 0;
}