【C语言】PAT甲级训练题目 1093题总结

其他题目：【C语言】PAT甲级训练题目答案、知识点梳理及总结

链接：原题

原题内容：

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

 思路：

很简单的一道题目，看到之后马上想到了n^3、n^2的算法，但是题目对于时间要求较为苛刻，因此开始考虑节省时间，尽量在一个循环内完成，写草稿后可简单地发现，只要在每次T出现的时候累加之前所有的P和A组合的可能性即可。

因此每当P和A出现的时候，要计算出当前所有的PA的可能，方便T出现时累加，按照这个思路，

程序就可以在O(n)的情况下完成。

代码：

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main()
{
    int j=0;
    long long count1=0;
    long long result=0,temp=0;
    char pat[100000];
    scanf("%s",pat);
    int len=strlen(pat);
    for(int i=0;i<len;i++)
    {
        if(pat[i]=='P')
            count1++;
        if(pat[i]=='A')
        {
            temp=temp+count1;
            j++;
        }
        if(pat[i]=='T')
            result+=temp;
    }
    result%=1000000007;
    printf("%lld",result);
    return 0;
}