题意
解析
前缀和思想。
f[i]用来代表到第i+1位有多少个满足s[k] == s[k+1]
所以题目求从l~r,即求f[r-1] - f[l-1]
代码
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 10,M = 1e6 + 10;
int n;
char s[N];
int f[N],m;
int main(){
scanf("%s",s+1);
n = strlen(s+1);
for(int i=1;i<=n-1;i++){
f[i] = f[i-1] + (s[i] == s[i+1]);
}
scanf("%d",&m);
while(m--){
int l,r;
scanf("%d %d",&l,&r);
printf("%d\n",f[r-1] - f[l-1]);
}
return 0;
}
标签:10,题意,int,long,CF313B,1100
From: https://www.cnblogs.com/dtdbm/p/17009285.html