luoguP1966 火柴排队(NOIP2013)(归并排序)

luogu P1966 火柴排队 题目

#include<iostream>
#include<cstdlib>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<iomanip>
#include<algorithm>
#include<ctime>
#include<queue>
#include<stack>
#define il inline
#define rg register
#define lst long long
#define N 100050
#define mod 99999997
using namespace std;

int n;
lst ans;
struct MARCH{
    int high,num;
}a[N],b[N];
int c[N],d[N];

il int read()
{
    rg int s=,m=;rg char ch=getchar();
    while(ch!='-'&&(ch<''||ch>''))ch=getchar();
    if(ch=='-')m=-,ch=getchar();
    while(ch>=''&&ch<='')s=(s<<)+(s<<)+ch-'',ch=getchar();
    return s*m;
}

il int cmp(rg const MARCH &x,rg const MARCH &y)
{
    return x.high<y.high;
}

void Merge_sort(rg int l,rg int r)
{
    if(l>=r)return;
    rg int mid=(l+r)>>;
    Merge_sort(l,mid),Merge_sort(mid+,r);
    rg int ll=l,rr=mid+,kk=l;
    while(ll<=mid&&rr<=r)
    {
        if(c[ll]>c[rr])
        {
            d[kk++]=c[rr++];
            ans=(ans+mid-ll+)%mod;
        }
        else d[kk++]=c[ll++];
    }
    while(ll<=mid)d[kk++]=c[ll++];
    while(rr<=r)  d[kk++]=c[rr++];
    for(rg int i=l;i<=r;++i)c[i]=d[i];
}

int main()
{
    n=read();
    for(rg int i=;i<=n;++i)a[i].high=read(),a[i].num=i;
    for(rg int j=;j<=n;++j)b[j].high=read(),b[j].num=j;
    sort(a+,a+n+,cmp);
    sort(b+,b+n+,cmp);
    for(rg int i=;i<=n;++i)
        c[a[i].num]=b[i].num;
    Merge_sort(,n);
    printf("%lld\n",ans);
    return ;
}