1093 Count PAT's

1093 Count PAT's （25 point(s)）

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，例子中给出的是appapt，其中有两个pat，观察可以发现规律，对于每个a，其左边x个P，右边y个T，则，pat的个数就是x*y； 由此，得到该题的解题思路：

1、第一趟从前往后遍历，得到对于位置i，i左边包括其自身有多少个p，

2、第二趟从后往前遍历，对于当前位置，得到右边共有多少个t，若是为A，则计数增加。

#include <cstdio>
#include <cstring>
#define MaxSize 100010
typedef long long LL;
int main()
{
	int nump[MaxSize];
	int numt[MaxSize];
	char str[MaxSize];
	int i,n;
	LL count=0;
	scanf("%s",&str);
	n=strlen(str);
	if(str[0]=='P')
		nump[0]=1;
	else 
		nump[0]=0;
	for(i=1;i<n;i++)
	{
		if(str[i]=='P')
			nump[i]=nump[i-1]+1;
		else
			nump[i]=nump[i-1];

	}
	numt[n]=0;
	for(i=n-1;i>=0;i--)
	{
		if(str[i]=='T')
			numt[i]=numt[i+1]+1;
		else
			numt[i]=numt[i+1];
		if(str[i]=='A' && i>0)
			count=(count+numt[i]*nump[i])%1000000007;
	}
	printf("%lld",count);
	

}

 

其实 在计算t的时候不需要再用数组了，可以直接用一个int值的。