题目大意:
给你一个长度为 n ( ≤ 200 000 ) n(\le200\,000) n(≤200000)的数字字符串, q ( ≤ 200 000 ) q(\le 200 \, 000) q(≤200000)次询问,每次询问给一个区间 [ l , r ] [l,r] [l,r],询问这个区间的字符串,最少要删除多少个字符,使得子序列包含 2017 2017 2017,不包含 2016 2016 2016,如果不行,则输出 − 1 -1 −1
解题思路:(思路来源:洛谷的题解)
- 设 ∅ , 2 , 20 , 201 , 2017 \emptyset,2,20,201,2017 ∅,2,20,201,2017分别为状态 0 , 1 , 2 , 3 , 4 0,1,2,3,4 0,1,2,3,4
- 再设 d p i , j dp_{i,j} dpi,j为前 i i i个字符,构成合法的 j j j状态,最少需要删除多少个字符, d p dp dp方程如下:( [ ] [] []里的条件不成立不能转移)
{ d p i , 0 = d p i − 1 , 0 + [ s i = = 2 ] d p i , 1 = m i n ( d p i − 1.1 + [ s i = = 0 ] , d p i − 1 , 0 [ s i = = 2 ] ) d p i , 2 = m i n ( d p i − 1.2 + [ s i = = 1 ] , d p i − 1 , 1 [ s i = = 0 ] ) d p i , 3 = m i n ( d p i − 1 , 3 + [ s i = = 7 ∨ s i = = 6 ] , d p i − 1 , 2 [ s i = = 1 ] ) d p i , 4 = m i n ( d p i − 1 , 4 + [ s i = = 6 ] , d p i − 1 , 3 [ s i = = 7 ] ) \left\{\begin{matrix} dp_{i,0} = dp_{i-1,0}+[s_i == 2] \\ dp_{i,1} = min(dp_{i-1.1} + [s_i == 0], \quad dp_{i-1,0} [s_i == 2]) \\ dp_{i,2} = min(dp_{i-1.2} + [s_i == 1], \quad dp_{i-1,1} [s_i == 0]) \\ dp_{i,3} = min(dp_{i-1,3} + [s_i == 7 \vee s_i == 6], \quad dp_{i-1,2} [s_i == 1]) \\ dp_{i,4} = min(dp_{i-1,4} + [s_i == 6], \quad dp_{i-1,3}[s_i == 7]) \end{matrix}\right. ⎩⎪⎪⎪⎪⎨⎪⎪⎪⎪⎧dpi,0=dpi−1,0+[si==2]dpi,1=min(dpi−1.1+[si==0],dpi−1,0[si==2])dpi,2=min(dpi−1.2+[si==1],dpi−1,1[si==0])dpi,3=min(dpi−1,3+[si==7∨si==6],dpi−1,2[si==1])dpi,4=min(dpi−1,4+[si==6],dpi−1,3[si==7])
- 观察上面的 d p dp dp方程可以发现,像这种常系数其次线性递推式可以用矩阵乘法来进行优化(重要思想)
- 设转移矩阵:( a i , j a_{i,j} ai,j为状态 i i i转移到 j j j需要删除的字符个数)
D = ( a 0 , 0 . . . a 0 , 4 a 1 , 0 . . . a 1 , 4 a 2 , 0 . . . a 2 , 4 a 3 , 0 . . . a 3 , 4 a 4 , 0 . . . a 4 , 4 ) D= \begin{pmatrix} a_{0,0} &... &a_{0,4} \\ a_{1,0} &... &a_{1,4} \\ a_{2,0} &... &a_{2,4} \\ a_{3,0} &... &a_{3,4} \\ a_{4,0} &... &a_{4,4} \end{pmatrix} D=⎝⎜⎜⎜⎜⎛a0,0a1,0a2,0a3,0a4,0...............a0,4a1,4a2,4a3,4a4,4⎠⎟⎟⎟⎟⎞
- 而对于对于区间 [ l , r ] [l,r] [l,r]的 d p dp dp求法,就变成了区间内转移矩阵的**“乘积( c i , j = m i n ( a i , k + b k , j ) c_{i,j}=min(a_{i,k}+b_{k,j}) ci,j=min(ai,k+bk,j),其实就是 i i i状态转移到 k k k状态,再转移到j状态要删除多少个字符取 m i n min min即可)“**
- 而对于区间内矩阵的乘积又可以用线段树来维护
- 具体初始化可以看看下面代码注释
AC代码:
#include <bits/stdc++.h>
#define ft first
#define sd second
#define pb push_back
#define IOS ios::sync_with_stdio(false), cin.tie(0), cout.tie(0) //不能跟puts混用
#define seteps(N) fixed << setprecision(N)
#define endl "\n"
const int maxn = 2e5 + 10;
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<int, int> pii;
const ll mod = 1e9 + 7;
int n, q;
char s[maxn];
struct Mat {
int mat[5][5];
Mat() {memset(mat, 0, sizeof(mat));}
friend Mat operator * (const Mat & a, const Mat & b) {
Mat c;
memset(c.mat, 20, sizeof(c.mat));
for (int i = 0; i <= 4; i++)
for (int j = 0; j <= 4; j++)
for (int k = 0; k <= 4; k++)
c.mat[i][j] = min(c.mat[i][j], a.mat[i][k] + b.mat[k][j]);
return c;
}
};
struct SegTree {
Mat d[maxn << 2];
#define ls rt << 1
#define rs ((rt << 1) | 1)
void build(int lc, int rc, int rt) {
if (lc == rc) {
memset(d[rt].mat, 20, sizeof(d[rt].mat));
for (int i = 0; i <= 4; i++) d[rt].mat[i][i] = 0;//初始化,i状态到i状态自然为1
if (s[lc] == '2') d[rt].mat[0][0] = 1, d[rt].mat[0][1] = 0;//如果当前是字符2,那么0状态到0状态就要删除1个字符,那么0状态到1状态就不用,下面同理
if (s[lc] == '0') d[rt].mat[1][1] = 1, d[rt].mat[1][2] = 0;
if (s[lc] == '1') d[rt].mat[2][2] = 1, d[rt].mat[2][3] = 0;
if (s[lc] == '7') d[rt].mat[3][3] = 1, d[rt].mat[3][4] = 0;
if (s[lc] == '6') d[rt].mat[3][3] = 1, d[rt].mat[4][4] = 1;
return;
}
int mc = lc + rc >> 1;
build(lc, mc, ls);
build(mc + 1, rc, rs);
d[rt] = d[ls] * d[rs];
return;
}
Mat query(int lc, int rc, int rt, int L, int R) {
if (L <= lc && rc <= R) return d[rt];
Mat res;
memset(res.mat, 20, sizeof(res.mat));
for (int i = 0; i <= 4; i++) res.mat[i][i] = 0; //设置单位元
if (rc < L || R < lc) return res; //不在范围内,返回单位元
Mat res1, res2;
int mc = lc + rc >> 1;
res1 = query(lc, mc, ls, L, R);
res2 = query(mc + 1, rc, rs, L, R);
res = res1 * res2;
return res;
}
} sgt;
int main() {
scanf("%d%d", &n, &q);
scanf("%s", s + 1);
sgt.build(1, n, 1);
int l, r;
while (q--) {
scanf("%d%d", &l, &r);
Mat res = sgt.query(1, n, 1, l, r);
if (res.mat[0][4] > n) printf("-1\n");
else printf("%d\n", res.mat[0][4]);
}
return 0;
}