首页 > 代码库 > HDU 5907 Find Q（字符串）
HDU 5907 Find Q（字符串）
传送门
Description
Byteasar is addicted to the English letter ‘q‘. Now he comes across a string S consisting of lowercase English letters.
He wants to find all the continous substrings of S, which only contain the letter ‘q‘. But this string is really really long, so could you please write a program to help him?
Input
The first line of the input contains an integer T(1≤T≤10), denoting the number of test cases.
In each test case, there is a string S, it is guaranteed that S only contains lowercase letters and the length of S is no more than 100000.
Output
For each test case, print a line with an integer, denoting the number of continous substrings of S, which only contain the letter ‘q‘.
Sample Input
2
qoder
quailtyqqq
Sample Output
1
7
思路
题意：找出SS的所有仅包含字母‘q‘的连续子串
只要求出每个位置能往右延伸多长即可。
#include<cstdio>#include<cstring>using namespace std;const int maxn = 100005;char a[maxn];int main(){ int T; scanf("%d",&T); while (T--) { __int64 res = 0,cnt = 0; scanf("%s",a); int len = strlen(a); for (int i = 0;i < len;) { if (a[i] == ‘q‘) { while (a[i] == ‘q‘) { i++; cnt++; } res += (1+cnt)*cnt/2; cnt = 0; } else { i++; } } printf("%I64d\n",res); } return 0;}
HDU 5907 Find Q（字符串）
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。