Surprising Strings POJ - 3096

题解

题目大意 一个字符串两个字符为一对 如果相同间距的字符对有相同的则不是好的

数据量比较小 暴力枚举间距并以每个位置为第一个字符检测 使用map存储

AC代码

#include <stdio.h>
#include <string>
#include <map>
#include <iostream>
using namespace std;
typedef long long ll;

const int INF = 0x3f3f3f3f;

int main()
{
#ifdef LOCAL
	//freopen("C:/input.txt", "r", stdin);
#endif
	string str;
	while (cin >> str, str != "*")
	{
		int flag = 1;
		for (int i = 1; i <= str.size(); i++) //距离
		{
			map<string, bool> mp;
			for (int j = 0; j < str.size(); j++)
			{
				int k = j + i;
				if (k > str.size())
					break;
				string s2;
				s2.push_back(str[j]);
				s2.push_back(str[k]);
				if (mp[s2])
					flag = 0;
				mp[s2] = true; 
			}
		}
		if (flag)
			cout << str << " is surprising." << endl;
		else
			cout << str << " is NOT surprising." << endl;
 	}

	return 0;
}