动态逆序对 HYSBZ - 3295 主席树套树状数组

#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<stack>
#include<cstring>
#include<set>
#include<iterator>
#include<list>
#include<deque>
#include<queue>
#include<map>
#include<cmath>
#include<sstream>
#include<cstdio>
#include<ctime>
#include<iomanip>
//#include<unordered_set>
using namespace std;
#define lowbit(x) x&(-x)
typedef long long ll;
typedef pair<int, int> P;
const int N = 1e5 + 10;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const int mod = 1e9 + 7;
int tot, n, m;
ll ans;
struct Segmenttree
{
	int lc, rc, val;
}t[N * 60];
int c[N];
int pre[N], suf[N];
int pos[N], a[N];
int root[N];
void init_update(int x, int val)
{
	for (int i = x; i <= n; i += lowbit(i))
	{
		c[i] += val;
	}
}
int init_ask(int x)
{
	int sum = 0;
	for (int i = x; i > 0; i -= lowbit(i))
	{
		sum += c[i];
	}
	return sum;
}
void init()
{
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; i++)
	{
		scanf("%d", &a[i]);
		pre[i] = init_ask(n) - init_ask(a[i]);
		ans += pre[i];
		pos[a[i]] = i;
		init_update(a[i], 1);
	}
	memset(c, 0, sizeof(c));
	for (int i = n; i >= 1; i--)
	{
		suf[i] = init_ask(a[i] - 1);
		init_update(a[i], 1);
	}
}
int query_tree(int k, int l, int r, int L, int R)
{
	//cout << l << " " << r << endl;
	if (!k)
		return 0;
	if (l >= L && R >= r)
	{
		return t[k].val;
	}
	int mid = (l + r) >> 1;
	int temp = 0;
	if (L <= mid)
		temp += query_tree(t[k].lc, l, mid, L, R);
	if (R > mid)
		temp += query_tree(t[k].rc, mid + 1, r, L, R);
	return temp;
}
int query(int p, int q, int l, int r)
{
	int temp = 0;
	for (int i = q; i > 0; i -= lowbit(i))
	{
		temp += query_tree(root[i], 1, n, l, r);
	}
	//cout << "query1 == " << temp << endl;
	for (int i = p; i > 0; i -= lowbit(i))
	{
		temp -= query_tree(root[i], 1, n, l, r);
	}
	//cout << "query == " << temp << endl;
	return temp;
}
void update_tree(int &k, int l, int r, int x)
{
	if (!k)
		k = ++tot;
	t[k].val++;
	if (l == r)
	{
		//cout << l << " ";
		//cout << "t.val == " << t[k].val << endl;
		return;
	}
	int mid = (l + r) >> 1;
	if (x <= mid)
		update_tree(t[k].lc, l, mid, x);
	else
		update_tree(t[k].rc, mid + 1, r, x);
}
void update(int p, int val)
{
	for (int i = p; i <= n; i += lowbit(i))
	{
		//cout << "here" << val << endl;
		update_tree(root[i], 1, n, val);
	}
}
int main()
{
	//freopen("e://3295/2.in", "r", stdin);
	//freopen("e://myout.out", "w", stdout);
	init();
	for (int i = 1; i <= m; i++)
	{
		int x;
		//cout << "ans == ";
		printf("%lld\n", ans);
		scanf("%d", &x);
		int p = pos[x];
		//cout << "pre + suf == " ;
		//cout << (pre[p] + suf[p]) << endl;
		ans -= (pre[p] + suf[p]);
		ans += query(p , n, 1, x - 1);
		ans += query(0, p - 1, x + 1, n);
		update(p, x);
	}
	return 0;
}