• <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)  編輯 收藏 引用 所屬分類: 數據結構與算法
            色妞色综合久久夜夜| 久久国产免费观看精品| 亚洲日韩欧美一区久久久久我 | 色婷婷综合久久久中文字幕| 亚洲精品乱码久久久久久蜜桃| 狠狠色丁香婷婷久久综合| 人人狠狠综合久久88成人| 久久国产精品久久精品国产| 亚洲精品美女久久久久99小说| 久久人人妻人人爽人人爽| 久久精品国产国产精品四凭| 精品国产乱码久久久久久呢 | 久久精品成人免费观看97| 久久天天躁狠狠躁夜夜躁2014| 97久久久精品综合88久久| 色悠久久久久久久综合网| 精品久久久久久国产91| 亚洲精品乱码久久久久久蜜桃| 久久无码av三级| 久久亚洲春色中文字幕久久久| 日日狠狠久久偷偷色综合免费| 色综合久久久久网| 国产V综合V亚洲欧美久久| 久久只这里是精品66| 国产成人精品久久亚洲高清不卡 | 亚洲国产另类久久久精品| 国产精品99久久久久久宅男| 国产69精品久久久久777| 久久AV高清无码| 亚洲第一极品精品无码久久| 久久婷婷色香五月综合激情| 精品久久国产一区二区三区香蕉| 国产一区二区精品久久| 亚洲精品乱码久久久久久久久久久久| 无码精品久久一区二区三区| 久久精品视屏| 色综合合久久天天给综看| 色天使久久综合网天天| 性做久久久久久久久久久| 狠狠色丁香婷婷久久综合| 国产69精品久久久久9999APGF|