資料結構學習之西南民大OJ

資料結構學習順序，棧和隊列，雜湊表，並查集，字典樹，堆....

優先隊列詳解：http://blog.csdn.net/kisstears/article/details/8670085

優先隊列簡單的一題：

http://218.194.91.48/acmhome/problemdetail.do?&method=showdetail&id=1309

#include<iostream>#include<stdio.h>#include<queue>#include<vector>#include<algorithm>using namespace std;struct cmp{bool operator() (int &a,int &b){return a<b;}};int main(){int m,n,i,j;priority_queue<int,vector<int>,cmp> que;scanf("%d%d",&n,&m);for(i=0;i<m;i++){int tem;scanf("%d",&tem);que.push(tem);}for(i=0;i<n;i++){int tem=que.top();que.pop();printf("%d\n",tem);if(tem & 1) tem=tem*3+1;else tem=tem/2;  que.push(tem);}}