【算法小结】分块思想算法&例题（updating）

最新推荐文章于 2025-08-22 19:21:44 发布

原创最新推荐文章于 2025-08-22 19:21:44 发布 · 185 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#算法 #c++ #蓝桥杯

算法小结专栏收录该内容

40 篇文章

订阅专栏

本文介绍了分块算法在处理大规模数列更新和查询问题中的应用，通过实例展示了如何利用分块算法优化效率。文章包含了多个例题，分别演示了基本的加法操作、区间查询以及最大值查找等，每个例题都给出了相应的C++代码实现，旨在帮助读者深入理解分块算法的工作原理和实际运用。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

pre文章：

【算法学习】分块算法入门_pengwill97的博客-CSDN博客_分块算法

「分块」数列分块入门1 – 9 by hzwer - 分块 - hzwer.com

例题选自：

https://loj.ac/p?keyword=%E5%88%86%E5%9D%97

例题1：

#include <bits/stdc++.h>
using namespace std;
int v[50005], bl[50005], atag[50005], blo;
void add(int a, int b, int c) {
    for (int i = a; i <= min(bl[a] * blo, b); i++)
        v[i] += c;

    if (bl[a] != bl[b]) {
        for (int i = (bl[b] - 1) * blo + 1; i <= b; i++)
            v[i] += c;
    }

    for (int i = bl[a] + 1; i <= bl[b] - 1; i++)
        atag[i] += c;
}
int main() {
    int n;
    cin >> n;
    blo = sqrt(n);

    for (int i = 1; i <= n; i++)
        cin >> v[i];

    for (int i = 1; i <= n; i++)
        bl[i] = (i - 1) / blo + 1;

    for (int i = 1; i <= n; i++) {
        int f, a, b, c;
        cin >> f >> a >> b >> c;

        if (f == 0)
            add(a, b, c);
        else
            cout << v[b] + atag[bl[b]] << endl;
    }

    return 0;
}

例题2：

#include<bits/stdc++.h>
using namespace std;
int v[50005], bl[50005], atag[50005], blo, n;
vector<int> ve[505];
void reset(int x) {
	ve[x].clear();
	for (int i = (x - 1) * blo + 1; i <= min(x * blo, n); i++) ve[x].push_back(v[i]);
	sort(ve[x].begin(), ve[x].end());
}
void add(int a, int b, int c) {
	for (int i = a; i <= min(bl[a] * blo, b); i++) v[i] += c;
	reset(bl[a]);
	if (bl[a] != bl[b]) {
		for (int i = (bl[b] - 1) * blo + 1; i <= b; i++) v[i] += c;
		reset(bl[b]);
	}
	for (int i = bl[a] + 1; i <= bl[b] - 1; i++) {
		atag[i] += c;
	}
}
int query(int a, int b, int c) {
	int ans = 0;
	for (int i = a; i <= min(bl[a] * blo, b); i++) {
		if (v[i] + atag[bl[a]]< c) ans++;
	}
	if (bl[a] != bl[b]) {
		for (int i = (bl[b] - 1) * blo + 1; i <= b; i++) {
			if (v[i] + atag[bl[b]] < c) ans++;
		}
	}
	for (int i = bl[a] + 1; i <= bl[b] - 1; i++) {
		int x = c - atag[i];
		ans += lower_bound(ve[i].begin(), ve[i].end(), x) - ve[i].begin();
	}
	return ans;
}
int main() {
	cin >> n; blo = sqrt(n);
	for (int i = 1; i <= n; i++) cin >> v[i];
	for (int i = 1; i <= n; i++) {
		bl[i] = (i - 1) / blo + 1;
		ve[bl[i]].push_back(v[i]);
	}
	for (int i = 1; i <= bl[n]; i++) sort(ve[i].begin(), ve[i].end());
	for (int i = 1; i <= n; i++) {
		int f, a, b, c; cin >> f >> a >> b >> c;
		if (f == 0) add(a, b, c);
		else cout << query(a, b, c * c) << endl;
	}
	return 0;
}

例题3：

#include<bits/stdc++.h>
using namespace std;
int v[100005], bl[100005], atag[100005], n, blo;
set<int> st[105];
void add(int a, int b, int c) {
	for (int i = a; i <= min(bl[a] * blo, b); i++) {
		st[bl[a]].erase(v[i]);
		v[i] += c;
		st[bl[a]].insert(v[i]);
	}
	if (bl[a] != bl[b]) {
		for (int i = (bl[b] - 1) * blo + 1; i <= b; i++) {
			st[bl[b]].erase(v[i]);
			v[i] += c;
			st[bl[b]].insert(v[i]);
		}
	}
	for (int i = bl[a] + 1; i <= bl[b] - 1; i++) atag[i] += c;
}
int query(int a, int b, int c) {
	int ans = -1;
	for (int i = a; i <= min(bl[a] * blo, b); i++) {
		int val = v[i] + atag[bl[a]];
		if (val < c) ans = max(val, ans);
	}
	if (bl[a] != bl[b]) {
		for (int i = (bl[b] - 1) * blo + 1; i <= b; i++) {
			int val = v[i] + atag[bl[b]];
			if (val < c) ans = max(val, ans);
		}
	}
	for (int i = bl[a] + 1; i <= bl[b] - 1; i++) {
		int x = c - atag[i];
		set<int>::iterator it = st[i].lower_bound(x);
		if (it == st[i].begin()) continue;
		it--;
		ans = max(ans, *it + atag[i]);
	}
	return ans;
}
int main() {
	cin >> n; blo = 1000;
	for (int i = 1; i <= n; i++) cin >> v[i];	
	for (int i = 1; i <= n; i++) {
		bl[i] = (i - 1) / blo + 1;
		st[bl[i]].insert(v[i]);
	}
	for (int i = 1; i <= n; i++) {
		int f, a, b, c; cin >> f >> a >> b >> c;
		if (f == 0) add(a, b, c);
		else cout << query(a, b, c) << endl;
	}
	return 0;
}

例题4：

#include<bits/stdc++.h>
#define int long long
using namespace std;
int v[50005], bl[50005], atag[50005], sum[50005], n, blo;
void add(int a,int b,int c) {
	for (int i = a; i <= min(bl[a] * blo, b); i++) v[i] += c, sum[bl[a]] += c;
	if (bl[a] != bl[b]) {
		for (int i = (bl[b] - 1) * blo + 1; i <= b; i++) v[i] += c, sum[bl[b]] += c;
	}
	for (int i = bl[a] + 1; i <= bl[b] - 1; i++) atag[i] += c;
}
int query(int a, int b) {
	int all = 0;
	for (int i = a; i <= min(bl[a] * blo, b); i++) all += (v[i] + atag[bl[a]]);
	if (bl[a] != bl[b]) {
		for (int i = (bl[b] - 1) * blo + 1; i <= b; i++) all += (v[i] + atag[bl[b]]);
	}
	for (int i = bl[a] + 1; i <= bl[b] - 1; i++) {
		all += (sum[i] + atag[i] * blo);
	}
	return all;
}
signed main() {
	cin >> n; blo = sqrt(n);
	for (int i = 1; i <= n; i++) {
		cin >> v[i];
		bl[i] = (i - 1) / blo + 1;
		sum[bl[i]] += v[i];
	}
	for (int i = 1; i <= n; i++) {
		int f, a, b, c; cin >> f >> a >> b >> c;
		if (f == 0) add(a, b, c);
		else cout << query(a, b) % (c + 1) << endl;
	}
	return 0;
}