PAT甲级——1093 Count PAT's (逻辑类型的题目)

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

题目大意：在一串字符中寻找能够拼凑出PAT的组合数量，字符配对要遵循原始字符串的先后顺序。

思路：开三个数组PPos、APos、TPos分别记录'P'、'A'、'T'三个字符所在的位置。遍历APos，对于当前位置的'A'，在它之前的'P'的个数和在它之后的'T'的个数之积就是当前的'A'的组合数量，所有的'A'的组合数量之和就是答案。

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

vector<int> PPos, APos, TPos;
string s;

int main()
{
	int num = 0;
	cin >> s;
	for (int i = 0; i < s.length(); i++) {
		if (s[i] == 'P')
			PPos.push_back(i);
		if (s[i] == 'A')
			APos.push_back(i);
		if (s[i] == 'T')
			TPos.push_back(i);
	}
	int PSize = PPos.size(),
		ASize = APos.size(),
		TSize = TPos.size(),
		PIndex = 0,
		TIndex = 0;
	for (int i = 0; i < ASize; i++) {
		while (PIndex < PSize && PPos[PIndex] < APos[i]) {
			PIndex++;
		}
		while (TIndex < TSize && TPos[TIndex] < APos[i]) {
			TIndex++;
		}
		if (TIndex >= TSize)
			break;
		num += PIndex * (TSize - TIndex);
		num = num % 1000000007;
	}
	cout << num << endl;
	return 0;
}