本文链接：https://blog.csdn.net/qingshui23/article/details/52725165

Find Q

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

Problem Description

Byteasar is addicted to the English letter ‘q’. Now he comes across a string

S $S$ consisting of lowercase English letters.

He wants to find all the continous substrings of

S $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) $T(1\leq T\leq10)$ , denoting the number of test cases.

In each test case, there is a string

S $S$ , it is guaranteed that

S $S$ only contains lowercase letters and the length of

S $S$ is no more than

100000 $100000$ .

Output

For each test case, print a line with an integer, denoting the number of continous substrings of

S $S$ , which only contain the letter ‘q’.

Sample Input

2 

qoder 

quailtyqqq

Sample Output

1 

7

Source

BestCoder Round #88

问题描述

Byteasar迷恋上了'q'这个字母。

在他眼前有一个小写字母组成的字符串$S$，他想找出$S$的所有仅包含字母'q'的连续子串。但是这个字符串实在是太长了，你能写个程序帮助他吗？

输入描述

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

对于每组数据，包含一行一个小写字母组成字符串$S$，保证$S$的长度不超过$100000$。

输出描述

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

解题思路：

首先用一个数组 $num[i]$ 记录表示的是连续 $i$ 个字母为 $q$ 的字串的个数，通过规律得到 $num[i]\ =\ num[i-1]\ +\ i$ , 得到了之后我们就直接判断有几个连续的 $q$ 就行了，然后统计答案。

$My\ Code：$

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>

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<MAXN; i++)
        ans[i] = ans[i-1] + i;
}
int main()
{
    Init();
    int T;
    scanf("%d",&T);
    while(T--){
        scanf("%s",str);
        LL len = strlen(str);
        LL sum = 0;
        LL ans1 = 0;
        for(LL i=0; i<len; i++){
            if(str[i] == 'q')
                sum++;
            else{
                ans1 += ans[sum];
                sum = 0;
            }
        }
        ans1 += ans[sum];
        cout<<ans1<<endl;
    }
    return 0;
}