【bestcoder】Find Q（简单思维）

最新推荐文章于 2023-09-22 07:30:00 发布

better_space

最新推荐文章于 2023-09-22 07:30:00 发布

阅读量489

点赞数

分类专栏： Bestcoder 文章标签：简单思维

本文链接：https://blog.csdn.net/better_space/article/details/52719345

版权

Bestcoder 专栏收录该内容

2 篇文章 0 订阅

订阅专栏

Find Q

Accepts: 392

Submissions: 780

Time Limit: 2000/1000 MS (Java/Others)

Memory Limit: 262144/131072 K (Java/Others)

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\leq T\leq10)$ , 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

本题想很好想，就是注意一下数据类型用 long long 型就好了，看似不超int 实则超int。

#include<cstdio>
#include<iostream>
#include<cstring>
#include<cmath>
#include<algorithm>
#define LL long long 
using namespace std;
const int N = 100000+20;
char S[N];
int main(){
	int T;
	scanf("%d",&T);
	while(T--){
		scanf("%s",S);
		LL cnt=0,ans=0;
		int L=strlen(S);
		for(int i=0;i<=L;i++){
			if(S[i]=='q'){
				cnt++;
			}
			else if(S[i]!='q'&&S[i-1]=='q'){
				for(int j=cnt;j>=1;j--){
					ans+=j;
				}
				cnt=0;
			}
		}
		printf("%lld\n",ans);
	}
	return 0;
}