zoj 3818(暴力)

题意：有一个字符串如果能写成ABABA或ABABCAB的形式且A、B、C不相等就输出yes，否则no。

题解：直接暴力。

#include <stdio.h>
#include <iostream>
#include <string.h>
#include <string>
#include <ctype.h>
#include <algorithm>
using namespace std;
const int N = 55;
string str, s;
int l;

bool judge1() {
	l = s.length();
	int len1 = (l - 2) / 3, cnt = 0;
	char a[N], b[N];
	while (1) {
		cnt++;
		if (cnt > len1)
			break;
		if ((l - cnt * 3) % 2 == 0) {
			int cnt2 = (l - cnt * 3) / 2, i, j;
			for (i = 0; i < cnt; i++)
				a[i] = s[i];
			for (i = cnt; i < cnt + cnt2; i++)
				b[i - cnt] = s[i];
			for (i = cnt + cnt2, j = 0; i < 2 * cnt + cnt2; i++, j++)
				if (s[i] != a[j])
					break;
			if (i < 2 * cnt + cnt2)
				continue;
			for (i = cnt * 2 + cnt2, j = 0; i < 2 * cnt + 2 * cnt2; i++, j++)
				if (s[i] != b[j])
					break;
			if (i < 2 * cnt + 2 * cnt2)
				continue;
			for (i = cnt * 2 + cnt2 * 2, j = 0; i < l; i++, j++)
				if (s[i] != a[j])
					break;
			if (i < l)
				continue;
			if (cnt == cnt2) {
				for (int i = 0; i < cnt; i++)
					if (a[i] != b[i])
						return true;
			}
			else
				return true;
		}
	}
	return false;
}

bool judge2() {
	l = s.length();
	int len1, len2, len3;
	if (l < 7)
		return false;
	for (len1 = 1; len1 <= l / 3; len1++)
		for (len2 = 1; len2 <= l - len1 * 3; len2++) {
			len3 = l - len1 * 3 - len2 * 3;
			if (len3 <= 0)
				continue;
			string s1, s2, s3, s4, s5, s6, s7;
			s1 = s.substr(0, len1);
			s2 = s.substr(len1, len2);
			if (s1 == s2)
				continue;
			s3 = s.substr(len1 + len2, len1);
			s4 = s.substr(len1 + len2 + len1, len2);
			s5 = s.substr(len1 * 2 + len2 * 2, len3);
			s6 = s.substr(len1 * 2 + len2 * 2 + len3, len1);
			s7 = s.substr(len1 * 3 + len2 * 2 + len3, len2);
			if (s1 == s3 && s3 == s6 && s2 == s4 && s4 == s7 && s1 != s5 && s2 != s5)
				return true;
		}
	return false;
}

int main() {
	int t;
	scanf("%d", &t);
	while (t--) {
		cin >> str;
		s = "";
		int len = str.length();
		for (int i = 0; i < len; i++)
			if ((str[i] <= 'z' && str[i] >= 'a') || (str[i] <= 'Z' && str[i] >= 'A'))
				s += str[i];
		if (judge1())
			printf("Yes\n");
		else if (judge2())
			printf("Yes\n");
		else
			printf("No\n");
	}
	return 0;
}