堆模板

最新推荐文章于 2024-07-08 16:47:21 发布

PoPoQQQ

最新推荐文章于 2024-07-08 16:47:21 发布

阅读量1.3k

点赞数

分类专栏：堆文章标签：堆模板

本文链接：https://blog.csdn.net/PoPoQQQ/article/details/38760567

版权

堆专栏收录该内容

22 篇文章 0 订阅

订阅专栏

void swap(int &x,int &y){int z=x;x=y;y=z;}
struct small_root_heap{
    int heap[M],top;
    void insert(int x){heap[++top]=x;int t=top;while(t>1&&heap[t]<heap[t>>1])swap(heap[t],heap[t>>1]),t>>=1;}
    void pop()
    {
        int t=2;
        heap[1]=heap[top];heap[top--]=0;
        while(t<=top)
        {
            if(heap[t]>heap[t+1]&&t<top)t++;
            if(heap[t]<heap[t>>1])swap(heap[t],heap[t>>1]),t<<=1;
            else break;
        }
    }
};
struct big_root_heap{
    int heap[M],top;
    void insert(int x){heap[++top]=x;int t=top;while(t>1&&heap[t]>heap[t>>1])swap(heap[t],heap[t>>1]),t>>=1;}
    void pop()
    {
        int t=2;
        heap[1]=heap[top];heap[top--]=0;
        while(t<=top)
        {
            if(heap[t]<heap[t+1]&&t<top)t++;
            if(heap[t]>heap[t>>1])swap(heap[t],heap[t>>1]),t<<=1;
            else break;
        }
    }
};