当前位置: 代码迷 >> 综合 >> PAT1093 Count PAT's (25)(逻辑题)
  详细解决方案

PAT1093 Count PAT's (25)(逻辑题)

热度:20   发布时间:2024-01-16 13:19:02.0

题意:

给出一个包含'P','A,'T''三种字符的字符串,问能找到几个PAT子串

思路:

这题是个逻辑题,想到了就很简单,可惜我没想到。基本思路就是找A,A左边的P个数*A右边的T个数累加即可。

#include<algorithm>
#include<iostream>
#include<cmath>
#include<queue>
#include<string>
#include<map>
#include<vector>
using namespace std;
const int mod = 1000000007;
const int maxn = 100500;
int countP, countA, countT;int main() {string s;cin >> s;for (int i = 0; i < s.size(); i++) {if(s[i]=='T')countT++;}int num = 0;for (int i = 0; i < s.size(); i++) {if (s[i] == 'P') countP++;if (s[i] == 'T') countT--;if (s[i] == 'A')num = (num + countP*countT) % mod;}printf("%d", num);return 0;
}

  相关解决方案