Ilya the Lion wants to help all his friends with passing exams. They need to solve the following problem to pass the IT exam.
You've got string s = s1s2... sn (n is the length of the string), consisting only of characters "." and "#" and m queries. Each query is described by a pair of integers li, ri (1 ≤ li < ri ≤ n). The answer to the query li, ri is the number of such integers i (li ≤ i < ri), thatsi = si + 1.
Ilya the Lion wants to help his friends but is there anyone to help him? Help Ilya, solve the problem.
The first line contains string s of length n (2 ≤ n ≤ 105). It is guaranteed that the given string only consists of characters "." and "#".
The next line contains integer m (1 ≤ m ≤ 105) — the number of queries. Each of the next m lines contains the description of the corresponding query. The i-th line contains integers li, ri (1 ≤ li < ri ≤ n).
Print m integers — the answers to the queries in the order in which they are given in the input.
...... 4 3 4 2 3 1 6 2 6
1 1 5 4
#..### 5 1 3 5 6 1 5 3 6 3 4
1 1 2 2 0
题解:线性打表,水题一枚,,直接附上代码
#include <cstdio> #include <cstring> typedef long long LL; #define maxn 100005 char s[maxn]; int main(void) { int m; int l,r,i,j,count; while(scanf("%s",s)!=EOF) { scanf("%d",&m); int len = strlen(s); int vis[maxn]={0}; for(int i = 1;i < len;++ i) vis[i]=((s[i]==s[i-1])?1:0)+vis[i-1]; for(i=0;i<m;i++) { count=0; scanf("%d%d",&l,&r); LL ans = vis[r-1]-vis[l-1]; printf("%lld\n",ans); } } return 0; }