HDU 1702 stack queue 的应用 大水题

ACboy needs your help again!Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1862    Accepted Submission(s): 1002


Problem DescriptionInputOutputSample InputSample Output#include<stdio.h>#include<stack>#include<queue>using namespace std;int main(){int cas,i,j,n,m;char s[10];scanf("%d",&cas);while(cas--){ scanf("%d %s",&n,s); if(s[2]=='F') { queue<int>que; for(i=0;i<n;i++) { scanf("%s",s); if(s[0]=='I') { scanf("%d\n",&m); que.push(m); } else { if(que.empty()) printf("None\n"); else { printf("%d\n",que.front()); que.pop(); } } } } else { stack<int>sta; for(i=0;i<n;i++) { scanf("%s",s); if(s[0]=='I') { scanf("%d\n",&m); sta.push(m); } else { if(sta.empty()) printf("None\n"); else { printf("%d\n",sta.top()); sta.pop(); } } } }}return 0;}