8.22的两道cdq，表示即使写完动态逆序对也还是不太会emmmm

陌上花开，可以缓缓而归已

#include<cstdio>
#include<iostream>
#include<bitset>
#include<cstring>
#include<string>
#include<algorithm>
#include<map>
#include<queue>
#include<set>
#include<cmath>
#define mp make_pair
#define pb push_back
#define ll long long
#define lc no[x].ch[0]
#define rc no[x].ch[1]
#define pa no[x].fa
#define db double
#define ls x<<1
#define rs x<<1|1
#define For(i,a,b) for(int i=a;i<=b;i++)
#define Forr(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
const int maxn=1e5+7;
struct node
{
    int s,c,m,ans,w;
}v[maxn];
bool operator <(node a,node b)
{
    if(a.s!=b.s)return a.s<b.s;
    if(a.c!=b.c)return a.c<b.c;
    return a.m<b.m;
}
bool operator == (node a,node b)
{
    return a.s==b.s&&a.c==b.c&&a.m==b.m;
}
bool cmp(node a,node b)
{
    if(a.c!=b.c)return a.c<b.c;
    return a.m<b.m;
}
int n,m,c[maxn*2];
inline int lowbit(int x)
{
    return x&(-x);
}
inline void add(int x,int y)
{
    while(x<=m)
    {
        c[x]+=y;
        x+=lowbit(x);
    }
}
inline int sum(int x)
{
    int ss=0;
    while(x>0)
    {
        ss+=c[x];
        x-=lowbit(x);
    }
    return ss;
}
void cdq(int l,int r)
{
    if(l==r) return ;
    int mid=(l+r)>>1;
    cdq(l,mid);cdq(mid+1,r);
    sort(&v[l],&v[mid+1],cmp);
    sort(&v[mid+1],&v[r+1],cmp);
    int i=l;
    for(int j=mid+1;j<=r;j++)
    {
        while(i<=mid&&v[i].c<=v[j].c)
        {
            add(v[i].m,v[i].w);
            ++i;
        }
        v[j].ans+=sum(v[j].m);
    }
    for(int j=l;j<i;j++)
    {
        add(v[j].m,-v[j].w);
    }
}
int ans[maxn];
int main()
{
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++)
    {
        scanf("%d%d%d",&v[i].s,&v[i].c,&v[i].m);
    }
    sort(&v[1],&v[n+1]);
    int cnt=0;
    for(int i=1;i<=n;i++)
    {
        if(v[i]==v[i-1])++v[cnt].w;
        else v[++cnt]=v[i],v[cnt].w++;
    }
    cdq(1,cnt);
    for(int i=1;i<=cnt;i++)
    {
        ans[v[i].ans+v[i].w-1]+=v[i].w;
    }
    for(int i=0;i<n;i++)printf("%d\n",ans[i]);
}

#include<cstdio>
#include<iostream>
#include<bitset>
#include<cstring>
#include<string>
#include<algorithm>
#include<map>
#include<queue>
#include<set>
#include<cmath>
#define mp make_pair
#define pb push_back
#define ll long long
#define lc no[x].ch[0]
#define rc no[x].ch[1]
#define pa no[x].fa
#define db double
#define ls x<<1
#define rs x<<1|1
#define For(i,a,b) for(int i=a;i<=b;i++)
#define Forr(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
const int maxn=1e5+7;
struct node
{
    int t,pl,n;
}v[maxn],p[maxn];
ll ans[maxn],c[maxn],st[maxn],pos[maxn],vis[maxn];
int n,m;
inline void add(int x,int y)
{
    while(x<=n)
    {
        c[x]+=1ll*y;
        x+=x&(-x);
    }
}
inline ll sum(int x)
{
    ll res=0;
    while(x>0)
    {
        res+=c[x];
        x-=x&(-x);
    }
    return res;
}
void cdq(int l,int r)
{
    if(l>=r) return ;
    int mid=(l+r)>>1;
    cdq(l,mid);cdq(mid+1,r);
    for(int i=l,j=l,q=mid+1;i<=r;i++)
    {
        if(j<=mid&&(q>r||v[j].n>v[q].n))p[i]=v[j++];
        else p[i]=v[q++];
    }
    for(int i=l;i<=r;i++)
    {
        v[i]=p[i];
        if(v[i].t<=mid)add(v[i].pl,1);
        else ans[v[i].t]+=sum(v[i].pl);
    }
    for(int i=l;i<=r;i++)if(v[i].t<=mid)add(v[i].pl,-1);
    for(int i=r;i>=l;i--)
    {
        if(v[i].t<=mid)add(v[i].pl,1);
        else ans[v[i].t]+=sum(n)-sum(v[i].pl);
    }
    for(int i=l;i<=r;i++)if(v[i].t<=mid)add(v[i].pl,-1);
}
int main()
{
    scanf("%d%d",&n,&m);
    int t,rr;
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&rr);
        pos[rr]=i;
    }
    for(int i=n;i>n-m;i--)
    {
        scanf("%d",&rr);
        v[i].t=i;
        v[i].pl=pos[rr];
        v[i].n=rr;
        vis[rr]=1;
    }
    int cnt=1;
    for(int i=1;i<=n;i++)
    {
        if(!vis[i])
        {
            v[cnt].t=cnt;
            v[cnt].pl=pos[i];
            v[cnt++].n=i;
        }
    }
    cdq(1,n);
    for(int i=1;i<=n;i++)ans[i]+=ans[i-1];
    for(int i=n;i>n-m;i--) printf("%lld\n",ans[i]);
}