2019 南昌网络赛 C. Hello 2019（线段树 + dp）

---

直接拿 codeforce 750E的代码把字符串和询问都倒过来

---

代码：

#include<iostream>
using namespace std;
#include<stdio.h>
#include<string.h>
#include<algorithm>
#define lson rt << 1,l,mid
#define rson rt << 1 | 1,mid + 1,r
const int maxn = 2e5 + 10;
const int inf = 0x3f3f3f3f;
int n,q;
char s[maxn];
struct node{
	int dp[5][5];
	node operator + (node a) {
		node c;
		for(int i = 0; i < 5; i++) {
			for(int j = 0; j < 5; j++) {
				c.dp[i][j] = inf;
				for(int k = 0; k < 5; k++)
					c.dp[i][j] = min(c.dp[i][j],dp[i][k] + a.dp[k][j]);
			}
		}
		return c;
	}
}tree[maxn << 2];
void build(int rt,int l,int r) {
	if(l == r) {
		for(int i = 0; i < 5; i++)
			for(int j = 0; j < 5; j++)
				tree[rt].dp[i][j] = (i == j) ? 0 : inf;
		if(s[l] == '2') {
			tree[rt].dp[0][0] = 1;
			tree[rt].dp[0][1] = 0;
		} else if(s[l] == '0') {
			tree[rt].dp[1][1] = 1;
			tree[rt].dp[1][2] = 0;
		} else if(s[l] == '1') {
			tree[rt].dp[2][2] = 1;
			tree[rt].dp[2][3] = 0;
		} else if(s[l] == '9') {
			tree[rt].dp[3][3] = 1;
			tree[rt].dp[3][4] = 0;
		} else if(s[l] == '8') {
			tree[rt].dp[3][3] = 1;
			tree[rt].dp[4][4] = 1;
		}
		return;
	}
	int mid = l + r >> 1;
	build(lson);build(rson);
	tree[rt] = tree[rt << 1] + tree[rt << 1 | 1];
}
node qry(int L,int R,int rt,int l,int r) {
	if(L <= l && r <= R) return tree[rt];
	int mid = l + r >> 1;
	if(R <= mid) return qry(L,R,lson);
	else if(L > mid) return qry(L,R,rson);
	else return qry(L,R,lson) + qry(L,R,rson);
}
int main() {
	scanf("%d%d",&n,&q);
	scanf("%s",s + 1);
	reverse(s + 1,s + n + 1);
	build(1,1,n);
	for(int i = 1; i <= q; i++) {
		int l,r;scanf("%d%d",&l,&r);
		l = n - l + 1;
		r = n - r + 1;
		swap(l,r);
		int res = qry(l,r,1,1,n).dp[0][4];
		printf("%d\n",res == inf ? -1 : res);
	}
	return 0;
}