UVa11111 - Generalized Matrioshkas

题目地址：点击打开链接

C++代码：

#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
#include <cmath>
#include <limits>
#include <string>
#include <sstream>
using namespace std;
int main()
{
	int IntMin=numeric_limits<int>::min();
	string s;
	while(getline(cin,s))
	{
		istringstream input(s);
		int x;
		vector<int> vi;
		while(input>>x)
			vi.push_back(x);
		int i,size;
		i=0;
		size=vi.size();
		vector<pair<int,int> > vp;
		vp.push_back(make_pair(vi[0],0));
		for(i=1;i<size;++i)
		{
			int j=vp.size()-1;
			int ans=0;
			while(j>=0&&vp[j].first==IntMin)
			{
				ans+=fabs((double)vp[j].second);
				--j;
			}
			if(j<0)
				break;
			if(vi[i]==-vp[j].first)
			{
				if(ans>=fabs((double)vi[i]))
					break;
				vp.erase(vp.begin()+j,vp.end());
				vp.push_back(make_pair(IntMin,vi[i]));
			}
			else
				vp.push_back(make_pair(vi[i],0));
		}
		if((i>=size)&&(vp.size()==1)&&vp[0].first==IntMin)
			cout<<":-) Matrioshka!"<<endl;
		else
			cout<<":-( Try again."<<endl;
	}
	return 0;
}