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,那么遍历字符串后对于每一A,它前面的P的个数和它后面的T的个数的乘积就是能构成的PAT的个数。
C++:
#include "string"
#include "cstdio"
#include "iostream"
using namespace std;
const int maxn=100010;
const int mod=1000000007;
string str;
int leftnum[maxn]={0};
int main(){
getline(cin,str);
int len=str.length();
int rightnum=0;
int ans=0;
for (int i=0;i<len;i++)
{
if (i>0)
leftnum[i]=leftnum[i-1];
if(str[i]=='P')
leftnum[i]++;
}
for (int i=len-1;i>=0;i--)
{
if (str[i]=='T')rightnum++;
else if (str[i]=='A')
{
ans=(ans+rightnum*leftnum[i])%mod;
}
}
printf("%d",ans);
return 0;
}