[CF]Ilya and Queries
来源:互联网 发布:java的框架 编辑:程序博客网 时间:2024/05/01 20:56
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.
......43 42 31 62 6
1154
#..###51 35 61 53 63 4
11220
题解:线性打表,水题一枚,,直接附上代码
#include <cstdio>#include <cstring>typedef long long LL;#define maxn 100005char 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;}
- CF:Ilya and Queries
- [CF]Ilya and Queries
- CF 313 B Ilya and Queries
- B. Ilya and Queries
- Ilya and Queries
- Ilya and Queries
- CF:Ilya and Bank Account
- codeforces 313B Ilya and Queries
- Codeforces 313B Ilya and Queries
- Code Forces 313B Ilya and Queries
- Codeforces 313B : Ilya and Queries
- CF 525C(Ilya and Sticks-贪心)
- CF 525 C. Ilya and Sticks
- cf#311 A. Ilya and Diplomas
- CF 557A(Ilya and Diplomas-贪心)
- CF 518 D. Ilya and Escalator 概率dp
- CF 678F Lena and Queries
- Codeforces Round #186 (Div. 2) / 313B Ilya and Queries (字符串处理)
- JAVA深入研究——Method的Invoke方法。
- 分享一下书签
- Linux感悟-前言
- 使用javamail发送邮件
- 小鸡腿U T8 CERC2015
- [CF]Ilya and Queries
- hrbust 1759 Lawnmower【思维题】
- php.ini 中配置项的设置
- lightoj 1138 (二分)
- 底滑抽屉(分享)
- JNI常用知识点总结
- HDU 4411 费用流,诡异的构图
- 373. Find K Pairs with Smallest Sums
- hdu 1023