• <ins id="pjuwb"></ins>
    <blockquote id="pjuwb"><pre id="pjuwb"></pre></blockquote>
    <noscript id="pjuwb"></noscript>
          <sup id="pjuwb"><pre id="pjuwb"></pre></sup>
            <dd id="pjuwb"></dd>
            <abbr id="pjuwb"></abbr>
            隨筆 - 87  文章 - 279  trackbacks - 0
            <2007年4月>
            25262728293031
            1234567
            891011121314
            15161718192021
            22232425262728
            293012345

            潛心看書研究!

            常用鏈接

            留言簿(19)

            隨筆分類(81)

            文章分類(89)

            相冊

            ACM OJ

            My friends

            搜索

            •  

            積分與排名

            • 積分 - 216468
            • 排名 - 117

            最新評論

            閱讀排行榜

            評論排行榜

            #include? < iostream >
            #include?
            < algorithm >
            using?namespace?std;

            const ? int ?MAXN? = ? 10000 ;

            class?MinHeap?{
            public :
            ????MinHeap();
            ????MinHeap(
            int ? * ,? int );
            ????void?swim(
            int );
            ????void?sink(
            int );
            ????void?insert(
            int );
            ????void?build();
            ????void?decreaseKey(
            int ?,? int );
            ????
            int ?delMin();
            ????
            int ?getMin();
            ????void?heapSort(
            int ? * ,? int );
            private :
            ????
            int ?a[MAXN];
            ????
            int ?hSize;
            ????
            int ? * arr;
            };

            MinHeap::MinHeap()?{
            ????hSize?
            = ? 0 ;
            }

            MinHeap::MinHeap(
            int ? * b,? int ?bLen)?{
            ????hSize?
            = ?bLen;
            ????arr?
            = ?b;
            ????
            for ?( int ?i = 0 ;?i < bLen;?i ++ )?a[i + 1 ]? = ?b[i];
            ????build();
            }

            void?MinHeap::swim(
            int ?p)?{
            ????
            int ?q? = ?p? >> ? 1 ,?t? = ?a[p];
            ????
            while ?(q?! = ? 0 )?{
            ????????
            if ?(t? >= ?a[q])?break;
            ????????a[p]?
            = ?a[p];
            ????????p?
            = ?q;
            ????????q?
            = ?p? >> ? 1 ;
            ????}
            ????a[p]?
            = ?t;
            }

            void?MinHeap::sink(
            int ?p)?{
            ????
            int ?q? = ?p? << ? 1 ,?t? = ?a[p];
            ????
            while ?(q? <= ?hSize)?{
            ????????
            if ?(q? < ?hSize? && ?a[q]? > ?a[q + 1 ])?q ++ ;
            ????????
            if ?(a[q]? >= ?t)?break;
            ????????a[p]?
            = ?a[q];
            ????????p?
            = ?q;
            ????????q?
            = ?p? << ? 1 ;
            ????}
            ????a[p]?
            = ?t;
            }

            int ?MinHeap::delMin()?{
            ????
            int ?ret? = ?a[ 1 ];
            ????a[
            1 ]? = ?a[hSize -- ];
            ????sink(
            1 );
            ????return?ret;
            }

            void?MinHeap::insert(
            int ?key)?{
            ????a[hSize
            ++ ]? = ?key;
            ????swim(hSize);
            }

            void?MinHeap::decreaseKey(
            int ?p,? int ?t)?{
            ????a[p]?
            = ?t;
            ????swim(p);
            }

            void?MinHeap::build()?{
            ????
            for ?( int ?i = hSize / 2 ;?i > 0 ;?i -- )?sink(i);
            }

            int ?MinHeap::getMin()?{
            ????return?a[
            1 ];
            }

            void?MinHeap::heapSort(
            int ? * b,? int ?bLen)?{
            ????hSize?
            = ?bLen;
            ????
            for ?( int ?i = 0 ;?i < bLen;?i ++ )?a[i + 1 ]? = ?b[i];
            ????build();
            ????
            int ?i,?k? = ? 0 ;
            ????
            while ?(hSize? > ? 0 )?{
            ????????b[k
            ++ ]? = ?a[ 1 ];
            ????????a[
            1 ]? = ?a[hSize -- ];
            ????????sink(
            1 );
            ????}
            ????
            for ?(i = 0 ;?i < bLen;?i ++ )?cout? << ?b[i]? << ? ' ?';
            }

            int ?main()?{
            ????
            int ?b[]? = ?{ 5 ,? 4 ,? 3 ,? 2 ,? 1 ,? 2 ,? 9 ,? 8 ,? 7 };
            ????MinHeap?h;
            ????h.heapSort(b,?sizeof(b)
            / sizeof(b[ 0 ]));
            ????system(
            " pause " );
            ????return?
            0 ;
            }
            posted on 2007-03-16 00:44 閱讀(1360) 評論(0)  編輯 收藏 引用 所屬分類: 數據結構與算法
            国产香蕉97碰碰久久人人| 久久精品无码午夜福利理论片 | 久久99中文字幕久久| 97久久超碰成人精品网站| 久久综合久久综合久久| 久久综合亚洲色HEZYO国产| 亚洲国产精品一区二区久久hs| 久久久久亚洲AV无码网站| 一本久久a久久精品综合夜夜| 伊人色综合久久天天人守人婷| 久久精品99久久香蕉国产色戒 | 久久午夜羞羞影院免费观看| 天天综合久久久网| 久久久噜噜噜久久中文字幕色伊伊| 狠狠88综合久久久久综合网| 亚洲天堂久久久| 99热热久久这里只有精品68| 久久久久无码精品国产| 久久婷婷国产剧情内射白浆 | 97久久超碰国产精品2021| 日韩AV毛片精品久久久| 亚洲嫩草影院久久精品| 久久久免费精品re6| 无码人妻久久一区二区三区蜜桃| 51久久夜色精品国产| 999久久久无码国产精品| 无码人妻久久一区二区三区 | 国产亚洲精午夜久久久久久 | 看全色黄大色大片免费久久久| 精品午夜久久福利大片| 久久久久久午夜成人影院| 色欲av伊人久久大香线蕉影院| 区亚洲欧美一级久久精品亚洲精品成人网久久久久| 国产高潮国产高潮久久久| 久久99国内精品自在现线| 伊人久久大香线蕉亚洲| 亚洲AV无码久久精品狠狠爱浪潮 | 天天影视色香欲综合久久| 九九久久精品无码专区| 久久久久久噜噜精品免费直播| 国产精品美女久久久网AV|