HDU 5907 Find Q（水） —— BestCoder Round #88
2017-02-11       个评论    来源： ITAK
我要投稿

HDU 5907 Find Q（水） —— BestCoder Round #88。

# Find Q

Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 262144/131072 K (Java/Others)
Total Submission(s): 319Accepted Submission(s): 181

Problem 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 问题描述
Byteasar迷恋上了'q'这个字母。

输入的第一行包含一个正整数$T(1\leq T\leq10)$，表示测试数据的组数。

对于每组数据，输出一行一个整数，即仅包含字母'q'的连续子串的个数。

# 解题思路：

MyCode：

#include
#include
#include
#include

using namespace std;

typedef long long LL;
const LL MAXN = 1e5+5;
LL ans[MAXN];
char str[MAXN];
void Init(){
memset(ans, 0, sizeof(ans));
ans[1] = 1;
for(LL i=1; i