技術標籤：筆記queue

#include <queue>
#include <cstdio>
#include <iostream>
using namespace std;
int main()
{
	queue<int> q;
	int n;
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		int a;
		cin>>a;
		q.push(a);
	}
	cout<<q.front()<<endl;//返回佇列隊首元素
	cout<<q.back
 
()<<endl;//返回佇列末尾元素
	cout<<q.size()<<endl;//返回佇列大小
	for(int i=1;i<=3;i++)
	{
		q.pop();
	}
	while(!q.empty())
	{
		cout<<q.front()<<" ";
		q.pop(); 
	}
}