qhq889的博客

题目链接#include<bits/stdc++.h>#define LL long long#define pii pair<int,int>#define all(x) x.begin(),x.end()#define mem(a, b) memset(a,b,sizeof(a))using namespace std;const int maxn = 2e5 + 5;const int MOD = 1e9 + 7;inline int read() {

定义： 长度为n的数组，如果有 i < j && a [ i ] > a [ j ],则称 ( i , j )为一对逆序对归并解法：#include<bits/stdc++.h>#define ll long longusing namespace std;const int maxn=1e6+5;int a[maxn],b[maxn...