#include <iostream>
#include <cstring>
#include <string>
#include <queue>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <cmath>
#include <cstdio>
#include <algorithm>
#define N 100010
#define LL __int64
#define inf 0x3f3f3f3f
#define lson l,mid,ans<<1
#define rson mid+1,r,ans<<1|1
#define getMid (l+r)>>1
#define movel ans<<1
#define mover ans<<1|1
using namespace std;
const LL mod = 1e9 + 7;
const double eps = 1e-9;
struct node{
LL sum;
int lazy;
}sum[N << 2];//线段树主体
struct Segment__Tree {
int x, y;
void pushUp(int ans) {
sum[ans].sum = sum[movel].sum + sum[mover].sum;
}
void pushDown(int ans) {
if (sum[ans].lazy) {
sum[movel].lazy += sum[ans].lazy;
sum[mover].lazy += sum[ans].lazy;
sum[movel].sum += sum[ans].lazy;
sum[mover].sum += sum[ans].lazy;
sum[ans].lazy = 0;
}
}
void build(int l, int r, int ans) {
if (l == r) {
cin >> sum[ans].sum;
return;
}
int mid = getMid;
build(lson);
build(rson);
pushUp(ans);
}
LL solve(int l, int r, int ans) {
if (l >= x&&r <= y) {
return sum[ans].sum;
}
pushDown(ans);
int mid = getMid;
if (mid<x) {
return solve(rson);
}
else if (mid >= y) {
return solve(lson);
}
else {
return solve(lson) + solve(rson);
}
}
void updata(int l, int r, int ans, int nums) {
if (l >= x&&r <= y) {
sum[ans].sum += nums;
sum[ans].lazy += nums;
return;
}
pushDown(ans);
int mid = getMid;
if (mid<x) {
updata(rson, nums);
}
else if (mid >= y) {
updata(lson, nums);
}
else {
updata(lson, nums);
updata(rson, nums);
}
pushUp(ans);
}
};
int main() {
cin.sync_with_stdio(false);
int c;
char s;
int n, q;
int Case = 1;
Segment__Tree tree;
while (cin >> n) {
tree.build(1, n, 1);
cin >> q;
cout << "Case #" << Case++ << ":" << endl;
while (q--) {
cin >> s >> tree.x >> tree.y;
if (tree.x > tree.y) {
swap(tree.x, tree.y);
}
if (s == '1') {
cout << tree.solve(1, n, 1) << endl;//查询
}
else {
cin >> c;
tree.updata(1, n, 1, c);//更新
}
}
cout << endl;
}
return 0;
}
加一个新的,包括了类似于要空间利用的需要先查找再更新的模板
#include <iostream>
#include <cstring>
#include <string>
#include <queue>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <cmath>
#include <cstdio>
#include <algorithm>
#define N 100010
#define LL __int64
#define inf 0x3f3f3f3f
#define lson l,mid,ans<<1
#define rson mid+1,r,ans<<1|1
#define getMid (l+r)>>1
#define movel ans<<1
#define mover ans<<1|1
using namespace std;
const LL mod = 1e9 + 7;
const double eps = 1e-9;
struct node {
int l, r, lazy;
int llen, rlen, maxlen;
}tree[N<<2];
struct nope {
int l, r;
}now;
map<int, nope> mapp;
struct Segment__Tree {
void pushDown(int ans, int num) {
if (tree[ans].lazy != -1) {
tree[gol].lazy = tree[ans].lazy;
tree[gor].lazy = tree[ans].lazy;
tree[gol].llen = tree[gol].rlen = tree[gol].maxlen = (tree[ans].lazy ? 0 : num - (num >> 1));
tree[gor].llen = tree[gor].rlen = tree[gor].maxlen = (tree[ans].lazy ? 0 : (num >> 1));
tree[ans].lazy = -1;
}
}
void pushUp(int ans, int num) {
tree[ans].llen = tree[gol].llen;
tree[ans].rlen = tree[gor].rlen;
tree[ans].maxlen = max(tree[gol].maxlen, tree[gor].maxlen);
if (tree[ans].llen == num - (num >> 1)) {
tree[ans].llen += tree[gor].llen;
}
if (tree[ans].rlen == num >> 1) {
tree[ans].rlen += tree[gol].rlen;
}
tree[ans].maxlen = max(tree[ans].maxlen, tree[gol].rlen + tree[gor].llen);
}
void build(int l, int r, int ans) {
tree[ans].l = l;
tree[ans].r = r;
tree[ans].lazy = -1;
tree[ans].llen = tree[ans].rlen = tree[ans].maxlen = r - l + 1;
if (l == r) {
return;
}
int mid = getMid;
build(lson);
build(rson);
}
void updata(int l, int r, int ans, int num) {//更新区间
if (l <= tree[ans].l&&r >= tree[ans].r) {
tree[ans].lazy = num;
tree[ans].llen = tree[ans].rlen = tree[ans].maxlen = (num ? 0 : tree[ans].r - tree[ans].l + 1);
return;
}
pushDown(ans, tree[ans].r - tree[ans].l + 1);
int mid = (tree[ans].l + tree[ans].r) >> 1;
if (l <= mid) {
updata(l, r, gol, num);
}
if (mid < r) {
updata(l, r, gor, num);
}
pushUp(ans, tree[ans].r - tree[ans].l + 1);
}
int query(int ans, int num) {//查询长度为num的空闲区间
if (tree[ans].l == tree[ans].r) {
return tree[ans].l;
}
pushDown(ans, tree[ans].r - tree[ans].l + 1);
int mid = (tree[ans].l + tree[ans].r) >> 1;
if (tree[gol].maxlen >= num) {
return query(gol, num);
}
if (tree[gol].rlen + tree[gor].llen >= num) {
return mid - tree[gol].rlen + 1;
}
return query(gor, num);
}
};
有关于面积并,周长并的扫描线模板
要进行离散化
struct Segment__Tree {
int x, y;
void pushUp(int l, int r, int ans) {
if (tree[ans]) sum[ans] = r - l + 1;
else if (l == r) sum[ans] = 0;
else sum[ans] = sum[movel] + sum[mover];
}
void build() {
memset(tree, 0, sizeof(tree));
memset(sum, 0, sizeof(sum));
}
void updata(int l, int r, int ans, int num) {
if (l >= x&&r <= y) {
tree[ans] += num;
pushUp(l, r, ans);
return;
}
int mid = getMid;
if (mid<x) {
updata(rson, num);
}
else if (mid >= y) {
updata(lson, num);
}
else {
updata(lson, num);
updata(rson, num);
}
pushUp(l, r, ans);
}
};
求一段区间去重后的和
#include <iostream>
#include <cstring>
#include <string>
#include <queue>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <cmath>
#include <cstdio>
#include <algorithm>
#define N 50010
#define M 200010
#define K 1000010
#define LL __int64
#define inf 0x3f3f3f3f
#define lson l,mid,ans<<1
#define rson mid+1,r,ans<<1|1
#define getMid (l+r)>>1
#define movel ans<<1
#define mover ans<<1|1
using namespace std;
const LL mod = 1e9 + 7;
const double eps = 1e-9;
const double eps = 1e-9;
struct node {
LL sum;
}sum[N << 2];//线段树主体
struct nope {
int l, r, id;
}fw[M];
LL num[N];
LL cnt[M];
map<LL,int> vis;
bool cmp(nope a, nope b) {
return a.r < b.r;
}
struct Segment__Tree {
int x, y;
void pushUp(int ans) {
sum[ans].sum = sum[movel].sum + sum[mover].sum;
}
void build(int l, int r, int ans) {
if (l == r) {
sum[ans].sum = 0;
return;
}
int mid = getMid;
build(lson);
build(rson);
pushUp(ans);
}
LL solve(int l, int r, int ans) {
if (l >= x&&r <= y) {
return sum[ans].sum;
}
int mid = getMid;
if (mid<x) {
return solve(rson);
}
else if (mid >= y) {
return solve(lson);
}
else {
return solve(lson) + solve(rson);
}
}
void updata(int l, int r, int ans, int kk, LL nums) {
if (l == r) {
sum[ans].sum += nums;
return;
}
int mid = getMid;
if (mid >= kk) {
updata(lson, kk, nums);
}
else {
updata(rson, kk, nums);
}
pushUp(ans);
}
};
int main() {
cin.sync_with_stdio(false);
int n, q;
int T;
Segment__Tree tree;
cin >> T;
while (T--) {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> num[i];
}
tree.build(1, n, 1);
cin >> q;
for (int i = 1; i <= q; i++) {
cin >> fw[i].l >> fw[i].r;
fw[i].id = i;
}
sort(fw + 1, fw + q + 1, cmp);
int ll = 1;
vis.clear();
for (int i = 1; i <= q; i++) {
while (ll <= fw[i].r) {
if (vis.find(num[ll]) != vis.end()) {
tree.updata(1, n, 1, vis[num[ll]], -num[ll]);
}
vis[num[ll]] = ll;
tree.updata(1, n, 1, ll, num[ll]);
ll++;
}
tree.x = fw[i].l;
tree.y = fw[i].r;
cnt[fw[i].id] = tree.solve(1, n, 1);
}
for (int i = 1; i <= q; i++) {
cout << cnt[i] << endl;
}
}
return 0;
}
加分割点的离散化模板
sort(v.begin(), v.end());
int len = v.size();
for (int i = 1; i < len; i++) {
if (v[i] - v[i - 1] > 1) {
v.push_back(v[i] + 1);
}
}
sort(v.begin(), v.end());
len = unique(v.begin(), v.end()) - v.begin();
if (len == 0) {
printf("0\n");
continue;
}
build(1, len, 1);
for (int i = 1; i <= n; i++) {
x = lower_bound(v.begin(), v.begin() + len, point[i].x) - v.begin() + 1;
y = lower_bound(v.begin(), v.begin() + len, point[i].y) - v.begin() + 1;
updata(1, len, 1, i);
}