PAT甲级1093 Count PAT's (25 分)

1093 Count PAT's (25 分)

The string APPAPT contains two PAT's as substrings. The first one is formed by the 2nd, the 4th, and the 6th characters, and the second one is formed by the 3rd, the 4th, and the 6th characters.

Now given any string, you are supposed to tell the number of PAT's contained in the string.

Input Specification:

Each input file contains one test case. For each case, there is only one line giving a string of no more than 10​5​​ characters containing only P, A, or T.

Output Specification:

For each test case, print in one line the number of PAT's contained in the string. Since the result may be a huge number, you only have to output the result moded by 1000000007.

Sample Input:

APPAPT

Sample Output:

2

      题目大意：

         给定一个字符串，请问从左向右的元素中可以组成多少个PAT？结果mod1000000007

 

 

思路：

         用String存储。算法思想如下：对于每一个A，其左边的P个数与右边T个数的乘积即为其能构成的PAT个数。

         那么就先将所有的t个数都记录下来，然后从头开始遍历，遇到P则cp++， 遇到t则ct++（因为是在准备要找的A的前面）， 遇到A就开始计数了。

         由于要mod1000000007， 所以算是变相提示了应当用int来计数并且每次加减乘除的时候应当都mod一次。

 

参考代码：

 

 

#include<string>
#include<iostream>
using namespace std;
int  cp, ca, ct, ans;
int main(){
	string s;
	cin >> s;
	for(int i = 0; i < s.size(); ++i)
		if(s[i] == 'T')	ct++;
	for(int i = 0; i < s.size(); ++i){
		if(s[i] == 'P') cp++;
		if(s[i] == 'T') ct--;
		if(s[i] == 'A') ans = (ans + (cp * ct) % 1000000007) % 1000000007;
	}
	printf("%d", ans);
	return 0;
} 

代码参考：https://blog.csdn.net/liuchuo/article/details/51985909