using namespace std;
stack<int> S;
queue<double> Q;
struct IPJ{
int rilak;
int betaveros;
};
stack<IPJ> QAQ;
Stack --> S
Queue --> Q
Priority_Queue -->PQ
Vector --> Vec
(vector通常會出現在圖論中,所以大多會用圖論專有名詞)
S.size()==0
!S.size()
using namespace std;
Q.size() == 0
!Q.size()
#include<queue>
using namespace std;
priority_queue<int> PQ;
PQ.push(); front(); pop();
PQ.empty()
自己推!