Array Transformer UVA - 12003 [分块]基础

调的我头皮发麻

#include<bits/stdc++.h>
#define endl "\n"
#define DE cout << "------" << endl
#define mems(a, b) memset(a, b, sizeof a)
#define re(a) memset(a, 0, sizeof a)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;

const int maxn = 4e5 + 7;
int lim, cnt, n, m, u;
ll a[maxn];
int bt[maxn];
int kuai[600][600];
int kb[maxn];

int main(){
	//freopen("in.txt", "r", stdin);
	//freopen("out.txt", "w", stdout);
	scanf("%d%d%d",&n,&m,&u);
	for(int i = 1; i <= n; i++) scanf("%d",&a[i]);
	lim = sqrt(n) + 1;
	for(int i = 1; i <= n; i++){
		if(kuai[cnt][0] >= lim || i == 1){
			cnt++;
			kb[cnt] = i;
		}
		kuai[cnt][++kuai[cnt][0]] = a[i];
		bt[i] = cnt;
	}
	for(int i = 1; i <= cnt; i++) sort(kuai[i] + 1, kuai[i] + 1 + kuai[i][0]);

	while(m--){
		int L, R, v, p;
		int k = 0;
		scanf("%d%d%d%d",&L,&R,&v,&p);
		//read(L), read(R), read(v), read(p);
		vector<int> t;
		for(int i = L; i <= min(R, kb[bt[L] + 1] - 1); i++) if(a[i] < v) k++;
		for(int i = bt[L] + 1; i <= bt[R] - 1; i++){
			k += lower_bound(kuai[i] + 1, kuai[i] + 1 + kuai[i][0], v) - kuai[i] - 1;
		}
		for(int i = max(kb[bt[R]], 1 + min(R, kb[bt[L] + 1] - 1)); i <= R; i++) if(a[i] < v) k++;

		int pp = lower_bound(kuai[bt[p]] + 1, kuai[bt[p]] + 1 + kuai[bt[p]][0], a[p]) - kuai[bt[p]];
		a[p] = 1LL * u * k / (R - L + 1);
		kuai[bt[p]][pp] = a[p];
		while(kuai[bt[p]][pp] > kuai[bt[p]][pp + 1] && pp + 1 <= kuai[bt[p]][0]){
			swap(kuai[bt[p]][pp], kuai[bt[p]][pp + 1]);
			pp++;
		}
		while(kuai[bt[p]][pp] < kuai[bt[p]][pp - 1] && pp - 1 >= 1){
			swap(kuai[bt[p]][pp], kuai[bt[p]][pp - 1]);
			pp--;
		}
	}

	for(int i = 1; i <= n; i++) {
		printf("%lld\n", a[i]);
		//if(i != n) puts("");
	}
}