NOIP 2013 火柴排队 程序

#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100000 + 1;
const int MOD = 99999997;
int n, F[MAXN], C[MAXN];
struct node
{
    int N, H;
}Match1[MAXN], Match2[MAXN];
void Update(int x)
{
    for (int i = x; i <= n; i += i&(-i))
        F[i]++;
}
int Query(int x)
{
    int S = 0;
    for (int i = x; i > 0; i -= i&(-i))
        S += F[i];
    return S;
}
bool comp(node x, node y)
{
    return x.H < y.H;
}
int main()
{
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        cin >> Match1[i].H;
        Match1[i].N = i;
    }
    for (int i = 1; i <= n; i++)
    {
        cin >> Match2[i].H;
        Match2[i].N = i;
    }
    sort(Match1 + 1, Match1 + (n+1), comp);
    sort(Match2 + 1, Match2 + (n+1), comp);
    for (int i = 1; i <= n; i++)
    {
        C[Match1[i].N] = Match2[i].N;
    }
    int Sum = 0;
    for (int i = 1; i <= n; i++)
    {
        Update(C[i]);
        Sum += i-Query(C[i]);
        Sum %= MOD;
    }
    cout << Sum << endl;
    return 0;
}

https://paste.ubuntu.com/p/Ckw9kpZ9qw/