CP002978 栈题解

该题符合栈（stack）数据结构的先进后出（First In Last Out,FILO）特性，代码如下：

#include<iostream>
#include<stack>
using namespace std;
// variables setting
stack<int>arr;
int x,n,i;
// functions(others) defining
// the program subject
void program()
{
    cin>>n;
    for(i=0;i<n;i++)
    {
        cin>>x;
        arr.push(x);
    }
    while(arr.size())
    {
        cout<<arr.top()<<" ";
        arr.pop();
    }
    cout<<endl;
}
// the main function
int main()
{
    //io;
    program();
    return 0;
}