• <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
            <2025年6月>
            25262728293031
            1234567
            891011121314
            15161718192021
            22232425262728
            293012345

            潛心看書研究!

            常用鏈接

            留言簿(19)

            隨筆分類(81)

            文章分類(89)

            相冊

            ACM OJ

            My friends

            搜索

            •  

            積分與排名

            • 積分 - 217774
            • 排名 - 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 閱讀(1366) 評論(0)  編輯 收藏 引用 所屬分類: 數據結構與算法
            亚洲精品白浆高清久久久久久| 国内精品免费久久影院| 亚洲午夜久久久久妓女影院| 久久亚洲欧美国产精品| 7国产欧美日韩综合天堂中文久久久久 | 精品视频久久久久| 一级做a爰片久久毛片毛片| 久久狠狠高潮亚洲精品| 久久露脸国产精品| 久久久久久无码Av成人影院| 青青久久精品国产免费看 | 合区精品久久久中文字幕一区 | 久久精品成人免费观看97| 伊人久久大香线蕉av不卡| 久久九九久精品国产| 久久久免费精品re6| 久久AV高潮AV无码AV| 久久精品国产99久久香蕉| 国内精品久久久人妻中文字幕| 伊人久久五月天| 久久亚洲精品无码观看不卡| 国产一区二区三区久久精品| 中文字幕无码免费久久| 伊人久久一区二区三区无码| 大蕉久久伊人中文字幕| 国内精品久久久久影院日本| 亚洲精品无码专区久久久| 欧美一区二区久久精品| 色婷婷噜噜久久国产精品12p| 国产福利电影一区二区三区久久久久成人精品综合 | 精品久久久久久久久久久久久久久| 久久久婷婷五月亚洲97号色| 中文精品久久久久人妻不卡| 久久精品极品盛宴观看| 久久大香萑太香蕉av| 波多野结衣久久一区二区| 国产精品99久久久久久宅男小说| 麻豆久久久9性大片| 亚洲AV日韩AV天堂久久| 国产精品久久久久国产A级| 久久精品国产免费一区|