1039.Zero-complexity Transposition

题目描述：
You are given a sequence of integer numbers. Zero-complexity transposition of the sequence is the reverse of this sequence. Your task is to write a program that prints zero-complexity transposition of the given sequence.
输入：
For each case, the first line of the input file contains one integer n-length of the sequence (0 ＜ n ≤ 10 000). The second line contains n integers numbers-a1, a2, …, an (-1 000 000 000 000 000 ≤ ai ≤ 1 000 000 000 000 000).
输出：
For each case, on the first line of the output file print the sequence in the reverse order.
样例输入：
5
-3 4 6 -8 9
样例输出：

9 -8 6 4 -3

这里还有一种更快的方法，从后往前输出即可。

注意这里的格式输出方法。

#include <iostream>
#include <algorithm>
#include <string>
#include <vector>

using namespace std;

int main()
{
	vector<string> svec;
	int n;
	while (cin >> n)
	{
		for (int i = 0; i < n; ++i)
		{
			string tmp;
			cin >> tmp;
			svec.push_back(tmp);
		}
		reverse(svec.begin(), svec.end());
		bool flag = true;
		for (vector<string>::size_type i = 0; i != n; ++i)
		{
			if (flag)
			{
				flag = false;
			}
			else
			{
				cout << " ";
			}
			cout << svec[i];
		}
		cout << endl;
		svec.clear();
	}
	return 0;
}