Array Transformer（分块，入门，*）

Array Transformer - UVA 12003 - Virtual Judge

题意：

给定一个序列，要求查询一个区间内有多少个数小于v。并且把第p个位置的值改为u * k / (R - L + 1)。

#include<iostream>
#include<string>
#include<cstring>
#include<cmath>
#include<ctime>
#include<algorithm>
#include<utility>
#include<stack>
#include<queue>
#include<vector>
#include<set>
#include<math.h>
#include<map>
#include<sstream>
#include<deque>
#include<unordered_map>
#include<unordered_set>
#include<bitset>
#include<stdio.h>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<long long, long long> PLL;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
const int INF = 0x3f3f3f3f;
const LL Mod = 1e9 + 7;
const int N = 3e5+ 10, M = 2e3 + 10;
int n, m, u;
LL a[N], ans[N];
int id[N];
int len;
struct Node {
	LL v;
	int id;
	Node(LL a = 0, int b = 0) {
		v = a, id = b;
	}
	bool operator<(const Node& A) {
		return v < A.v;
	}
};
vector<Node>q[N];

int query(int l, int r, int c) {
	int sid = id[l], eid = id[r];
	int k = 0;
	if (sid == eid) {
		for (int i = l; i <= r; i++) {
			if (a[i] < c)k++;
		}
		return k;
	}
	for (int i = l; id[i] == sid; i++) {
		if (a[i] < c)k++;
	}
	for (int i = r; id[i] == eid; i--) {
		if (a[i] < c)k++;
	}
	for (int i = sid + 1; i < eid; i++) {
		k += lower_bound(q[i].begin(), q[i].end(), c)-q[i].begin();
	}
	return k;
}

void modify(int p, LL c) {
	a[p] = c;
	int pos = id[p];
	for (int i = 0; i < q[pos].size(); i++) {
		if (q[pos][i].id == p) {
			if (q[pos][i].v == c)return;
			q[pos][i].v = c;
			int pp = i;
			while (pp > 0 && q[pos][pp].v < q[pos][pp - 1].v) {
				swap(q[pos][pp], q[pos][pp - 1]);
				pp--;
			}
			while (pp < q[pos].size() - 1 && q[pos][pp].v > q[pos][pp + 1].v) {
				swap(q[pos][pp], q[pos][pp + 1]);
				pp++;
			}
			return;
		}
	}
}

int main() {
	cin >> n >> m >> u;
	len = sqrt(n);
	for (int i = 1; i <= n; i++) {
		scanf("%d", &a[i]);
		id[i] = (i - 1) / len + 1;
		q[id[i]].push_back({ a[i],i });
	}
	for (int i = 1; i <= id[n]; i++) {
		sort(q[i].begin(), q[i].end());
	}
	int l, r, v, p;
	while (m--) {
		scanf("%d%d%d%d", &l, &r, &v, &p);
		int k = query(l, r, v);
		modify(p,1ll* u * k / (r - l + 1));
	}
	for (int i = 1; i <= id[n]; i++) {
		for (int j = 0; j < q[i].size(); j++) {
			ans[q[i][j].id] = q[i][j].v;
		}
	}
	for (int i = 1; i <= n; i++) {
		printf("%lld\n", ans[i]);
	}
	return 0;
}