1093 Count PAT's (25 point(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

直接暴力搜索必然会TLE，复杂度已经达到了 ，这是不可以接受的。

此时换一个思路，在字符串中遍历A。当A固定的时候，其可以组成PAT的数量是之前的P的数量乘以之后T的数量。这样只需要维护两个数组，保存P和T的个数和即可，复杂度降到了。

#include<iostream> 
#include<cstring>
using namespace std;
const int MOD = 1000000007;
const int LEN = 1e5+7;
int Pcnt[LEN]={0};
int Tcnt[LEN]={0};
int main(void){
	string s;cin>>s;
	for(int i=0;i<s.length();i++){
		if(s[i]=='P'){
			if(i==0) Pcnt[i]=1;
			else Pcnt[i]=Pcnt[i-1]+1;
		}
		else{
			if(i==0) Pcnt[i]=0;
			else Pcnt[i]=Pcnt[i-1];
		}
		if(s[i]=='T'){
			if(i==0) Tcnt[i]=1;
			else Tcnt[i]=Tcnt[i-1]+1;
		}
		else{
			if(i==0) Tcnt[i]=0;
			else Tcnt[i]=Tcnt[i-1];
		}
	}
	int sum =0;
	for(int i=1;i<s.length()-1;i++){
		if(s[i]=='A'){
			sum = (sum+Pcnt[i-1]*(Tcnt[s.length()-1]-Tcnt[i]))%MOD;
		}
	}
	cout<<sum<<endl;
	return 0;
}