模板 基础数据结构

//主要这些东西竟然都不会手打...

队列

#include<cstdio>
#include<iostream>
#define MAXN 1<<20
using namespace std;
int n;
struct queue{
    int l,r,q[MAXN];
    queue():l(1),r(0) {}
    inline void push(int x){q[++r]=x;}
    inline void pop(){l++;}
    inline int front(){return q[l];}
    inline bool size(){return l<=r;}
};
int main(){
    scanf("%d",&n);
    for(int i=0;i<n;i++) q.push(i+1);
    while(q.size()) {
        printf("%d ",q.front());q.pop();q.push(q.front());q.pop();
    }
    return 0;
}

#include<cstdio>
#include<iostream>
#define MAXN 1<<20
using namespace std;
int n;
struct queue{
    int l,r,q[MAXN];
    queue():l(1),r(0) {}
    inline void push(int x){q[(++r)|(MAXN-1)]=x;}
    inline void pop(){l++;}
    inline int front(){return q[l|(MAXN-1)];}
    inline bool size(){return l<=r;}
};
/*struct queue{
    int l,r,q[MAXN];
    queue():l(1),r(0) {}
    inline void push(int x){q[(++r)&(MAXN-1)]=x;}
    inline void pop(){l++;}
    inline int front(){return q[l&(MAXN-1)];}
    inline bool size(){return l<=r;}
};*/
queue q;
int main(){
    scanf("%d",&n);
    for(int i=0;i<n;i++) q.push(i+1);
    while(q.size()) {
        printf("%d ",q.front());q.pop();q.push(q.front());q.pop();
    }
    return 0;
}

 

栈

#include<cstdio>
#define MAXN 1<<20
using namespace std;
struct Tstack{
    const int MAXdata=10000;
    int top,data[MAXdata];
    Tstack() {top=0;}
    void push(int x){data[++top]=x;}
    void pop(){top--;}
    int top(){return data[top];}
    bool empty(){return top==0;}
};
int main(){
    
} 

 

边表

#include<cstdio>
#include<vector>
using namespace std;
const int MAXN=1<<20;
vector <pair<int,int> >G[MAXN];
inline void add(int u,int v,int w){
    G[u].push_back(make_pair(v,w));
    G[v].push_back(make_pair(u,w)); 
}
int main(){
    for(int i=0;i<G[i].size();i++){
        int v=G[u][i].first;
        int w=G[u][i].second;
    }
}

#include<cstdio>
#include<vector>
#define MAXN 1<<20
using namespace std;
vector <int> linker[MAXN],v[MAXN];
inline void addedge(int x,int y,int z){
    linker[x].push_back(y);
    v[x].push_back(z); 
}
int main(){
    for(int i=0;i<linker[x].size();i++){
        //查询元素个数：size() 
        //do something 
    }
} 
// 稀疏图  

vector

#include<cstdio>
#define MAXN 1<<20
using namespace std;
struct edge{
    int to,next,v;
}e[MAXN];
//add edge 
inline void insert(int u,int v,int w){
    cnt++;
    e[cnt].to=v;
    e[cnt].next=last[u];
    last[u]=cnt;
    e[cnt].v=w;
}
// 遍历  
int main(){
    for(int i=last[now];i;i=e[i].next){
        //do sth
    }
}
// 稠密图  

 

堆

#include<cstdio>
#include<queue>
#define MAXN 1000005
using namespace std;
int n;
priority_queue<int,vector<int>,greater<int> >q;
int main(){
    scanf("%d",&n);
    while(n--){
        int time;scanf("%d",&time);
        if(time==1) {int x;scanf("%d",&x);q.push(x);}
        if(time==2) {int top;top=q.top();printf("%d\n",top);}
        if(time==3) {q.pop();}
    }
    return 0;
}

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define MAXN 100005
using namespace std;
int n,sum=0;
struct heap{
    int t[MAXN];
    void push(int x){
        t[++sum]=x;
        for(int i=sum,j=i>>1;j;i=j,j=i>>1){
            if(t[j]>t[i]) swap(t[j],t[i]);
        }
    }
    void pop(){
        t[1]=t[sum--];
        for(int i=1,j=i<<1;j<=sum;i=j,j=i<<1){
            if(j+1<=sum&&t[j+1]<t[j]) j++;
            if(t[i]<t[j]) break;
            else swap(t[i],t[j]);
        }
    }
}q;
int main(){
    scanf("%d",&n);
    while(n--){
        int time;scanf("%d",&time);
        if(time==1) {int x;scanf("%d",&x);q.push(x);}
        if(time==2) {int top;top=q.t[1];printf("%d\n",top);}
        if(time==3) {q.pop();}
    }
    return 0;
}

#include<stdio.h>
#include<string.h>
const int maxN=1000005;
int swap(int &a,int &b){int c=a;a=b;b=c;}
struct heap{
    int data[maxN],tail;
    heap(){tail=0;}
    inline int min(int a,int b){
        if(b>tail)return a;
        return data[a]<data[b]?a:b;
    }
    void up(int x){
        if(x==1)return;
        if(data[x]<data[x>>1]){
            swap(data[x],data[x>>1]);
            up(x>>1);
        }
    }
    void down(int x){
        if(x<<1>tail)return;
        int p=min(x<<1,(x<<1)+1);
        if(data[p]<data[x]){
            swap(data[p],data[x]);
            down(p);
        }
    }
    void push(int x){data[++tail]=x;up(tail);}
    void pop(){swap(data[tail],data[1]);tail--;down(1);}
    int top(){return data[1];}
}h;
int main(){
    int n,a,b; scanf("%d",&n);
    while(n--){
        scanf("%d",&a);
        if(a==1){
            scanf("%d",&b);
            h.push(b);
        }
        if(a==2){
            printf("%d\n",h.top());
        }
        if(a==3){
            h.pop();
        }
    }
}