Poj——Symmetric Order

题目

In your job at Albatross Circus Management (yes, it's run by a bunch of clowns), you have just finished writing a program whose output is a list of names in nondescending order by length (so that each name is at least as long as the one preceding it). However, your boss does not like the way the output looks, and instead wants the output to appear more symmetric, with the shorter strings at the top and bottom and the longer strings in the middle. His rule is that each pair of names belongs on opposite ends of the list, and the first name in the pair is always in the top part of the list. In the first example set below, Bo and Pat are the first pair, Jean and Kevin the second pair, etc.

Input

The input consists of one or more sets of strings, followed by a final line containing only the value 0. Each set starts with a line containing an integer, n, which is the number of strings in the set, followed by n strings, one per line, sorted in nondescending order by length. None of the strings contain spaces. There is at least one and no more than 15 strings per set. Each string is at most 25 characters long.

Output

For each input set print "SET n" on a line, where n starts at 1, followed by the output set as shown in the sample output.

题目大意就是，给你一大堆名字，两两一组，把他们分好组之后，一个放头一个放尾那么输出，第一组也就是最上面的那一组，会首先输出，也就是组内第一个放在最上面，组内第二个放在最下面，以此类推，放完为止。

思路

我设了新的数组c来存放，用一个标志flag来控制上下的转换，每设定好一个flag就反向，保证永远都是上下交替

 

 

代码

#include <iostream>
#include <stdio.h>
#include <algorithm>
using namespace std;
string a[15],c[15]; 
int main()
{
	int n,flag=1;
	while(cin>>n&&n!=0)
	{
		int left=0,right=n-1;//c的指针
	    bool sign=true;
		for(int i=0;i<n;i++)
		{
		  cin>>a[i];
		}	
		for(int i=0;i<n;i++)
		{
			if(sign)
			{
				c[left]=a[i];
			    left++;
			    sign=!sign;
			}
			else
			{
				c[right]=a[i];
			    right--;
			    sign=!sign;
			}
		}
		cout<<"SET "<<flag<<endl;
		for(int j=0;j<n;j++)cout<<c[j]<<endl;
		flag++;
	}
  }