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

思路：从头到尾计数P出现的个数，如果遇到了A ，那么这个A和前面的P字符数能够构成PA组合，而构成PA组合的数目就是 A字符位置之前的所有P字符数目。如果遇到了T字符，那么该T字符和前面的PA字符构成PAT字符的数目应该是这个T字符之前所有A字符保存的能够构成PA组合的数目之和。

字符串能够构成PAT的数目，就是所有A字符对应数字之和

额，可能读者需要捋一捋。

代码：

#include <iostream>
#include <string>
using namespace std;



int main()
{
    string str;
    cin>>str;
   
    long pNum=0;
    long aNum=0;
    long tNum=0;
    for(int i=0;i<str.size();i++){
        if(str[i]=='P'){
            pNum++;

        }
        else if(str[i]=='A'){

            aNum=(aNum+pNum)%1000000007;
        }
        else{
            tNum=(tNum+aNum)%1000000007;
        }
    }
    cout<<tNum;

    return 0;
}