[AcWing面向模型编程]树状数组

题目1：243. 一个简单的整数问题2

分析：

$presum[i]=sum1(i)\ast (i+1)-sum2(i)$

• sum1(i)是求差分ai的前缀和
• sum2(i)是求i * ai的前缀和

维护两个前缀和

代码：

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;//三年竞赛一场空，不开long long见祖宗 
//typedef __int128 lll;
#define print(i) cout << "debug: " << i << endsl
#define close() ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define mem(a, b) memset(a, b, sizeof(a))
#define pb(a) push_back(a)
#define x first
#define y second
typedef pair<int, int> pii;
const ll mod = 1e9 + 7;
const int maxn = 2e5 + 10;
const int inf = 0x3f3f3f3f;
ll a[maxn];
ll c1[maxn], c2[maxn];
int n, m;

int lowbit(int x)
{
	return x & -x;
}

void add(ll c[], int pos, ll val)
{
	for(int i = pos; i <= n; i += lowbit(i))
		c[i] += val;
}

ll sum(ll c[], int pos)
{
	ll res = 0;
	for(int i = pos; i >= 1; i -= lowbit(i))
		res += c[i];
	return res;
}

ll presum(int x)
{
	return sum(c1, x) * (x + 1) - sum(c2, x);
}

int main()
{
	cin >> n >> m;
	for(int i = 1; i <= n; i++) 
	{
		cin >> a[i];
		ll dif = a[i] - a[i - 1];
		add(c1, i, dif), add(c2, i, dif * i);
	}
	while(m--)
	{
		string ope;
		int l, r, d;
		cin >> ope >> l >> r;
		if(ope[0] == 'Q')
			cout << presum(r) - presum(l - 1) << endl;
		else
		{
			cin >> d;
			add(c1, l, d), add(c1, r + 1, -d);
			add(c2, l, l * d), add(c2, r + 1, -d * (r + 1));
		}
	}
}

题目2：AcWing 244. 谜一样的牛

分析：

要实现的两个操作

1. 查找数组中第k大的数
2. 删除数组中的某个数

代码：

#include <cstring>
#include <iostream>
#include <algorithm>

using namespace std;

const int N = 100010;

int n;
int h[N];
int ans[N];
int tr[N];

int lowbit(int x)
{
    return x & -x;
}

void add(int x, int c)
{
    for (int i = x; i <= n; i += lowbit(i)) tr[i] += c;
}

int sum(int x)
{
    int res = 0;
    for (int i = x; i; i -= lowbit(i)) res += tr[i];
    return res;
}

int main()
{
    scanf("%d", &n);
    for (int i = 2; i <= n; i ++ ) scanf("%d", &h[i]);

    for (int i = 1; i <= n; i ++ ) add(i, 1);

    for(int i = n; i >= 1; i--)
	{
		int k = h[i] + 1;
		int l = 1, r = n;
		while(l <= r)
		{
			int mid = l + r >> 1;
			if(sum(mid) >= k) r = mid - 1;
			else l = mid + 1;
		}
		ans[i] = l;
		add(l, -1);
	}

    for (int i = 1; i <= n; i ++ ) printf("%d\n", ans[i]);

    return 0;
}