【直线划分+逆序数】ZOJ 3574

左边交点从小到大排序，右边求逆序数，用归并求，注意要处理一下左边交点共点的情况，答案就是直线数+交点数+1，一不小心刷到rank2...ORZ

#define N 30005
struct node{
    int l,r;
}p[N];
int a[N];
int n;
int tmp[N];
int num;
void merge_sort1(int l,int mid,int r) {
    int k = 1;
    int i = l,j = mid+1;
    while(i<=mid && j<=r){
        if(p[j].r<p[i].r){
            tmp[k++] = p[j++].r;
            num += mid-i+1;//求逆序数！
        } else tmp[k++] = p[i++].r;
    }
    while(i<=mid)tmp[k++] = p[i++].r;
    while(j<=r)tmp[k++] = p[j++].r;
    for(i=l,j=1;i<=r;i++,j++){
        p[i].r = tmp[j];
    }
}
void merge_sort0(int s,int t){
    if (s==t)return ;
    int mid=(s+t)/2;
    merge_sort0(s,mid);
    merge_sort0(mid+1,t);

    merge_sort1(s,mid,t);
}
bool cmp(node a,node b){
    return a.l<b.l;
}
int main(){
    int s,t;
    while(scanf("%d%d",&s,&t) != -1){
        int i,j;
        scanf("%d",&n);
        for(i=1;i<=n;i++){
            int k,b;
            scanf("%d%d",&k,&b);
            p[i].l = k*s+b;
            p[i].r = k*t+b;
        }
        sort(p+1,p+n+1,cmp);
        num = 0;
        for(i=2;i<=n;i++){
            if(p[i].l == p[i-1].l && p[i].r<p[i-1].r)
                swap(p[i].r,p[i-1].r);
        }
        merge_sort0(1,n);
        printf("%d\n",n+num+1);
    }
    return 0;
}