1093 Count PAT’s (25point(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 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:
2
第一次写博客嘿嘿。这一次有点机智了。
思路:因为PAT的总数应该是每一个P后面每一个A后面每一个T的和,所以从后向前遍历。时间复杂度O(N)。
#include<iostream>
#include<string>
using namespace std;
int main(){
string s;
cin>>s;
long int cntT=0,cntAT=0,cntPAT=0;
for(long int i=s.size()-1;i>=0;i--){
if(s[i]=='T') cntT++;
else if(s[i]=='A') cntAT+=cntT;
else if(s[i]=='P') cntPAT+=cntAT;
}
cout<<cntPAT%1000000007<<endl;
return 0;
}