Codeforces 1234D-Distinct Characters Queries【线段树】

题意

给一个字符串，m次操作
操作1，把下标为 pos 的字符改成c
操作2，查询 l 到 r 的区间不同的字符数

思路

26颗线段树维护一下

代码

#include <bits/stdc++.h>
#define maxn 101000
using namespace std;

char str[maxn];

struct node{
	int l, r, sum;
}tree[26][maxn*3];

void build(int root, int l, int r){
	for(int i = 0; i < 26; i++){
		tree[i][root].l = l; tree[i][root].r = r; tree[i][root].sum = 0;
	}
	if(l == r){
		return;
	}
	int mid = (l + r)>>1;
	build(root<<1, l, mid);
	build(root<<1|1, mid+1, r);
}

void update(int root, int treenum, int pos, int num){
	if(tree[treenum][root].l == tree[treenum][root].r){
		tree[treenum][root].sum += num;
		return;
	}
	int mid = (tree[treenum][root].l + tree[treenum][root].r)>>1;
	if(pos <= mid){
		update(root<<1, treenum, pos, num);
	}
	else{
		update(root<<1|1, treenum, pos, num);
	}
	tree[treenum][root].sum = tree[treenum][root<<1].sum + tree[treenum][root<<1|1].sum;
}

int query(int root, int treenum, int L, int R){
	if(tree[treenum][root].l == L && tree[treenum][root].r == R){
		return tree[treenum][root].sum;
	}
	int mid = (tree[treenum][root].l + tree[treenum][root].r)>>1;
	if(R <= mid){
		return query(root<<1, treenum, L, R);
	}
	else if(L > mid){
		return query(root<<1|1, treenum, L, R);
	}
	else{
		return query(root<<1, treenum, L, mid) + query(root<<1|1, treenum, mid+1, R);
	}
}

int main(){
	int n, m, op, x, y;
	char ss[5];
	str[0] = '#';
	scanf("%s", &str[1]);
	n = strlen(str) - 1;
	build(1, 1, n);
	scanf("%d", &m);
	for(int i = 1; i <= n; i++){
		update(1, str[i]-'a', i, 1);
	}
	while(m--){
		scanf("%d", &op);
		if(op == 1){
			scanf("%d%s", &x, &ss);
			if(str[x] != ss[0]){
				update(1, str[x]-'a', x, -1);
				update(1, ss[0]-'a', x, 1);
				str[x] = ss[0];
			}
		}
		else{
			scanf("%d%d", &x, &y);
			int c = 0;
			for(int i = 0; i < 26; i++){
				if(query(1, i, x, y)){
					c++;
				}
			}
			printf("%d\n", c);
		}
	}
}