【PAT】1093 Count PAT's 解题报告

最新推荐文章于 2024-12-11 16:40:07 发布

原创最新推荐文章于 2024-12-11 16:40:07 发布 · 157 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

PAT甲级专栏收录该内容

8 篇文章

订阅专栏

本文介绍了一种算法，用于计算给定字符串中特定子串'PAT'出现的次数。通过预先计算左侧P的数量和右侧T的数量，再结合中间A的位置，有效地解决了这一问题。最终结果对1000000007取模，适用于处理大量数据。

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 105 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:

题解

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn = 100010; 
const int mod = 1000000007;
int leftNumP[maxn] = {0};//每一位左边含p的个数 
int main()
{
	char str[maxn];
	while(scanf("%s", str) != EOF){
		int len = strlen(str);
		int i;
		for(i = 0; i < len; i++){
			if(i > 0){
				leftNumP[i] = leftNumP[i - 1];
			}
			if(str[i] == 'P'){
				leftNumP[i]++;
			}
		}
		int ans = 0, rightNumT = 0;
		for(i = len - 1; i >= 0; i--){
			if(str[i] == 'T'){
				rightNumT++;
			}
			else if(str[i] == 'A'){
				ans = (ans + leftNumP[i] * rightNumT) % mod;
			}
		}
		printf("%d\n", ans);
	}
	return 0;
}