Code Forces 313B Ilya and Queries
来源:互联网 发布:mac电脑数据恢复 编辑:程序博客网 时间:2024/05/22 18:22
Description
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 "#" andm queries. Each query is described by a pair of integersli, ri(1 ≤ li < ri ≤ n). The answer to the query li, ri is the number of such integersi(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.
Input
The first line contains string s of lengthn(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 nextm lines contains the description of the corresponding query. Thei-th line contains integers li, ri(1 ≤ li < ri ≤ n).
Output
Print m integers — the answers to the queries in the order in which they are given in the input.
Sample Input
......43 42 31 62 6
1154
#..###51 35 61 53 63 4
11220
DP。
dp[i]表示到这个i位置连续出现的字符数。
那么结果便是两头一减。
#include <stdio.h>#include <string.h>#define N 100005char s[N];int dp[N];int main(){ int n,m; memset(dp,0,sizeof(dp)); scanf("%s",s); n=strlen(s); scanf("%d",&m); for(int i=1;i<n;i++){dp[i]+=dp[i-1];if(s[i]==s[i-1])dp[i]++;}int l,r; while(m--) { scanf("%d%d",&l,&r); printf("%d\n",dp[r-1]-dp[l-1]); } return 0;}
- Code Forces 313B Ilya and Queries
- B. Ilya and Queries
- codeforces 313B Ilya and Queries
- CF 313 B Ilya and Queries
- Codeforces 313B Ilya and Queries
- Codeforces 313B : Ilya and Queries
- Code Forces 525C Ilya and Sticks
- Code Forces 644B Processing Queries
- Code Forces 557 A. Ilya and Diplomas(水~)
- CF:Ilya and Queries
- Ilya and Queries
- [CF]Ilya and Queries
- Ilya and Queries
- Codeforces Round #186 (Div. 2) / 313B Ilya and Queries (字符串处理)
- code forces 401B Sereja and Contests
- Code forces 699B
- Code Forces 276 B. Little Girl and Game 贪心
- code forces 400B Inna and New Matrix of Candies
- 旋转矩阵与四元数
- Excel 2013导出图表的两种方法
- 技术栈资料汇总
- MFC 常用类 Cstring 方法使用:
- [LeedCode OJ]#36 Valid Sudoku
- Code Forces 313B Ilya and Queries
- Android性能优化典范(二)
- [leetcode] Best Time to Buy and Sell Stock III
- 递归删除文件,递归计算1+2+...+100
- Java中的迭代器模式
- 用dumpdecrypted给App砸壳
- 技术学习
- jquery extend的用法
- 黑马程序员--Java面向对象