【树链剖分】[ZJOI2008][HYSBZ/BZOJ1036]树的统计Count

题目链接

代码

[code]#include<cstdio>
#include<algorithm>
#include<cstring>
#define INF 0x7fffffff
using namespace std;
#define MAXN 100000
int n,a[MAXN+10],b[MAXN+10];
void Read(int &x){
    char c;
    while(c=getchar(),c!=EOF)
        if(c>='0'&&c<='9'){
            x=c-'0';
            while(c=getchar(),c>='0'&&c<='9')
                x=x*10+c-'0';
            ungetc(c,stdin);
            return;
        }
}
void read(){
    Read(n);
    int i;
    for(i=1;i<=n;i++)
        Read(a[i]);
    for(i=1;i<=n;i++)
        Read(b[i]);
}
int make_it_win(int *a,int *b){
    int i,l1,l2,r1,r2,ret=0;
    l1=l2=1,r1=r2=n;
    for(i=1;i<=n;i++){
        if(a[r1]>b[r2])
            ret+=2,r1--,r2--;
        else if(a[l1]>b[l2])
            ret+=2,l1++,l2++;
        else
            ret+=(a[l1]==b[r2]),l1++,r2--;
    }
    return ret;
}
int main()
{
    read();
    sort(a+1,a+n+1);
    sort(b+1,b+n+1);
    printf("%d %d\n",make_it_win(a,b),n*2-make_it_win(b,a));
}