nyoj 600 花儿朵朵

http://acm.nyist.net/JudgeOnline/problem.php?pid=600

离散化 + 树状数组，

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<string.h>
#include<stdlib.h>
#include<algorithm>
using namespace std;
typedef long long LL;
const int inf = 100010;
int sum[4*inf],c[4*inf],s[4*inf];
int i ,j,m,n,N;
struct A
{
    int index,val;
}a[4*inf];
int cmp(A p1, A p2)
{
    if(p1.val == p2.val) return p1.index < p2.index;
    return p1.val < p2.val;
}
int lowbit(int x)
{
    return x&(-x);
}
void update(int x,int y)
{
    while(x <= N)
    {
        c[x] += y;
        x += lowbit(x);
    }
}
long long query(int x)
{
    LL res = 0;
    while(x >0)
    {
        res += c[x];
        x -= lowbit(x);
    }
    return res;
}
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        scanf("%d%d",&n,&m);
        N = 2*n + m;
        memset(c,0,sizeof(c));
        for(i = 1; i <= N; i++)
        {
            scanf("%d",&a[i].val);
            a[i].index = i;
            //cout<<a[i].val<<"***"<<endl;
        }
        sort(a+1,a+N+1,cmp);
        int num = 0;
        s[a[1].index] = ++num;
        for(i = 2; i <= N; i++)
        {
            if(a[i].val != a[i-1].val) s[a[i].index] = ++num;
            else s[a[i].index] = num;
        }
        for(i = 1; i <= 2*n; i+=2)
        {
            update(s[i],1);
            update(s[i+1]+1,-1);
        }
        for(i = 2*n+1; i <= N; i++)
        printf("%lld\n",query(s[i]));
    }
    return 0;
}