PAT 甲级1093 C++题解

最新推荐文章于 2023-06-11 01:15:08 发布

Striver SkyTu

最新推荐文章于 2023-06-11 01:15:08 发布

阅读量194

点赞数

分类专栏： PAT刷题

本文链接：https://blog.csdn.net/weixin_44031260/article/details/114549426

版权

PAT刷题专栏收录该内容

15 篇文章 0 订阅

订阅专栏

1093 Count PAT’s (25 分)

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

解题思路

如果用暴力解法遍历会导致在字符串过长的情况下时间复杂度陡增，因此此题需要考虑更加巧妙的方法。通过读题可以发现对于任意A，其能构成的PAT的数量应与左侧P和右侧T进行排列组合，也就是说假设左侧n个P，右侧有m个T，则能够构成m*n个PAT，如此一来此题便迎刃而解。

需要注意的是string这个标准模板库如果要输入或输出整个字符串，则只能用cin和cout

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

int main()
{
    string str;
    int sum,count[2] = {0};//count[0]记录左侧P的个数，count[1]记录右侧T的个数
    cin>>str;
    for(string::iterator it = str.begin(); it!=str.end();it++)//由于右侧T要递减，因此先遍历一轮记录有多少个T
    {
        if(*it == 'T')
            count[1]++;
    }
    for(string::iterator it = str.begin(); it!=str.end();it++)//逢A计算count[0]*count[1]并累加至sum中
    {
        if(*it == 'P')
            count[0]++;
        else if(*it == 'T')
            count[1]--;
        else
            sum += (count[0]*count[1])%1000000007;
        sum = sum%1000000007;
    }
    printf("%d",sum);
}