#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;

int main ()
{
	vector<string>vect;
	string tem;
	int len;
	cin>>len;
	int count=0;
	int i;
	vector<string>::iterator beg;
	vector<string>::iterator end;
	for(i=0;i<len;i++)
	{
		cin>>tem;
		vect.push_back(tem);
	}

	while(!vect.empty())
	{

		if(*vect.begin()<*(vect.end()-1))
		{
			cout<<*(vect.begin());
			vect.erase(vect.begin());
			++count;
			if(count%80==0)
				cout<<endl;
			continue;
		}

		if(*vect.begin()>*(vect.end()-1))
		{
			cout<<*(vect.end()-1);
			vect.erase(vect.end()-1);
			++count;
			if(count%80==0)
				cout<<endl;
			continue;


		}
		if(*vect.begin()==*(vect.end()-1))
		{

			beg=vect.begin ();
			end=vect.end()-1;
			for(i=0;;i++)
			{
				++beg;
				--end;
				if(beg>=end)
				{
					cout<<*vect.begin();
					vect.erase(vect.begin());
					++count;
					break;
				}



				if(*beg<*end&&beg<end)
				{
					cout<<*vect.begin();
					vect.erase(vect.begin());
					++count;
					break;
				}
				if(*beg>*end&&beg<end)
				{
					cout<<*(vect.end()-1);
					vect.erase(vect.end()-1);
					++count;
					break;
				}
				if(*beg==*end&&beg<end)
				{
					continue;

				}
			}
		}
		if(count%80==0)
			cout<<endl;
	}
	return 0;
}

• Re:STL首题，感觉有点大材小用了 (1582) denganliang 2011-03-29 00:12:41