UVa 1588 - Kickdown

好吧刚开始看这题的时候没仔细看题目，以为可以把字符串反转来做。

结果wa了几次之后发现并不可以。题目不难，对两条字符串分别扫一次取较小值即可。

题目链接：1588 - Kickdown

#include <iostream>
#include <cstring>
#include <cstdlib>
#include <string>
#include <cstdio>
#include <algorithm>
using namespace std;
int main()
{
	string s1,s2;
	while (cin>>s1>>s2)
	{
		string& a = s1.size() > s2.size() ? s1 : s2;
		string& b = s1.size() > s2.size() ? s2 : s1;
		int x[101], y[101], pnx = 0, pny = 0, i, j;
		int len1 = a.size() + b.size(), len2 = a.size() + b.size();
		bool flag;
		for (int i = 0; i < b.size(); i++)
		{
			if (b[i] == '2') y[pny++] = i;
		}
		for (int i = 0; i < a.size(); i++)
		{
			if (a[i] == '2') x[pnx++] = i;
		}
		for ( i = 0; i < a.size(); i++)
		{
			flag = true;
			for (j = 0; j < pny&&flag; j++)
			{
				if (i + y[j] >= a.size()) break;
				if (a[i + y[j]] == '2')
				{
					flag = false;
					break;
				}
			}
			if (flag)
			{
				if (i + b.size() - 1 >= a.size())
					len1 = b.size() + i ;
				else
					len1 = a.size();
				break;
			}
		}
		for (i = 0; i < b.size(); i++)
		{
			flag = true;
			for (j = 0; j < pnx&&flag; j++)
			{
				if (i + x[j] >= b.size()) break;
				if (b[i + x[j]] == '2')
				{
					flag = false;
					break;
				}
			}
			if (flag)
			{
				len2 -= b.size() - i;
				break;
			}
		}
		cout << (len1<len2?len1:len2) << endl;
	}
	system("pause");
	return 0;
}