1093 Count PAT's

1093 Count PAT'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.

 

思路：对于每个A，记录它的前面有几个P，后面有几个T；然后对于每个A，PAT的组合有（前P）*（后T）种

#include <iostream>
#include <string>
#include <vector>
#include <queue>
using namespace std;
const int maxn = 100005;

int main(){
    string s; cin >> s;
    int pre[maxn], back[maxn];
    fill(pre,pre+maxn,0); fill(back, back+maxn, 0);
    int preP=0;
    for(int i=0;i<s.length();i++){
        pre[i] = preP;
        if(s[i]=='P') preP++;
    }
    int backT=0;
    for(int i=s.length()-1;i>=0;i--){
        back[i] = backT;
        if(s[i]=='T') backT++;
    }
    long long cnt;
    for(int i=0;i<s.length();i++){
        if(s[i]=='A'){
            cnt += pre[i]*back[i];
        }
        if(cnt>1000000007) cnt%=1000000007;
    }
    printf("%lld\n",cnt);
}