1040 有几个PAT
#include<stdio.h>
#include<iostream>
#include<vector>
#include<string>
using namespace std;
const int N = 1e5 + 10;
const int mod = 1e9 + 7;
int P[N], T[N];
int main(void) {
string s;
cin >> s;
s = '0' + s;
int ans = 0;
for (int i = 1; i < s.size(); i++) {
if (s[i] == 'P') { P[i] = P[i - 1] + 1; }
else { P[i] = P[i - 1]; }
if (s[i] == 'T') { T[i] = T[i - 1] + 1; }
else { T[i] = T[i - 1]; }
}
for (int i = 1; i < s.size(); i++) {
if (s[i] == 'A') {
ans = (ans + P[i] * (T[s.size() - 1] - T[i])) % mod;
}
}
cout << ans;
return 0;
}