yzl_rex

对于算法,我只是一个草民!

zoj 1405 Tanning Salon
#include "iostream"
#include "string"
using namespace std;

int main()
{
	int beds, i, len, size, count, pos;
	string ans, customers, temp;
	while (cin >> beds && beds)
	{
		cin >> customers;
		len = customers.length();
		count = 0;
		ans.clear();
		temp.clear();
		for (i = 0; i < len; i++)
		{
			if (ans.empty())//如果是空的,就直接插入!
				ans += customers[i];
			else//如果不是,则要分情况讨论,如果在ans中可以找到的,而且长度小于beds的,就进行删除操作,否则顾客就离开!
			{
				size = ans.size();
				if (size < beds)
				{
					pos = ans.find(customers[i]);
					if (pos >= 0)
						ans.erase(pos,1);
					else
						ans += customers[i];
				}
				else
				{
					pos = ans.find(customers[i]);
					if (pos >= 0)
						ans.erase(pos,1);
					else
					{
						if (temp.empty())
						{
							temp += customers[i];
							count++;
						}
						else
						{
							int p = temp.find(customers[i]);
							temp += customers[i];
							if (p < 0)
								count++;
						}
					}
				}
			}
		}
		if (count)
			cout << count << " customer(s) walked away." << endl;
		else
			cout << "All customers tanned successfully." << endl;
	}
}

阅读更多
文章标签: include
个人分类: ZOJ
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

不良信息举报

zoj 1405 Tanning Salon

最多只允许输入30个字

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭