青青草原综合久久大伊人导航_色综合久久天天综合_日日噜噜夜夜狠狠久久丁香五月_热久久这里只有精品

T9的空間

You will never walk alone!

  C++博客 :: 首頁 :: 新隨筆 :: 聯系 :: 聚合  :: 管理 ::
  69 隨筆 :: 0 文章 :: 28 評論 :: 0 Trackbacks
//用習慣了STL_heap自己來寫一個,類實現。

#include
<iostream>
#include
<string>
#include
<cmath>
#include
<algorithm>
using namespace std;

#define N 100

class my_heap{    
public:
    
int array[N];
    
int cnt;

    my_heap()
    
{
        
for(int i=0;i<N;i++)
            array[i]
=0;
        cnt
=0;
    }

    
void push(int num);
    
int pop();
}
;

void my_heap::push(int num)
{
    array[
++cnt]=num;
    
int i=cnt,j=i/2;
    
while(j>0)
    
{
        
if(array[i]>array[j])
            swap(array[i],array[j]);
        
else break;
        i
=j;j=i/2;
    }

}

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                
                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                
int my_heap::pop()                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      
{
    
int num=array[1],maxc;
    swap(array[
1],array[cnt]);
    cnt
--;
    
int i=1,j=2*i;
    
while(j<=cnt)
    
{
        
if(j+1>cnt) maxc=j;
        
else maxc=array[j]>array[j+1]?j:j+1;
        
if(array[maxc]>array[i])
            swap(array[i],array[maxc]);
        
else break;
        i
=maxc;j=2*i;
    }

    
return num;
}
   
                                                                                              
int main()
{
    
int num;
    my_heap h;
    
while(scanf("%d",&num),num)
        h.push(num);
    
while(h.cnt)
        printf(
"%d ",h.pop());
    printf(
"\n");
    
for(int i=1;h.array[i]&&i<N;i++)
        printf(
"%d ",h.array[i]);
    printf(
"\n");
    
return 0;
}
測試數據及結果:
1 4 9 88 56 21 45 7 6 3 99 1452 122 34 2 0
1452 122 99 88 56 45 34 21 9 7 6 4 3 2 1
1 2 3 4 6 7 9 21 34 45 56 88 99 122 1452
Press any key to continue
posted on 2008-11-23 12:42 Torres 閱讀(249) 評論(0)  編輯 收藏 引用 所屬分類: Data Structures
青青草原综合久久大伊人导航_色综合久久天天综合_日日噜噜夜夜狠狠久久丁香五月_热久久这里只有精品
  • <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>
            亚洲一区bb| 亚洲第一精品夜夜躁人人爽| 日韩视频免费看| 欧美日韩国产欧| 这里只有精品在线播放| 这里只有精品电影| 国产婷婷色一区二区三区在线 | 欧美视频在线观看视频极品| 亚洲午夜一区| 欧美一区中文字幕| 亚洲国产一区二区视频| 日韩亚洲欧美精品| 国产婷婷精品| 亚洲人成网站精品片在线观看| 国产精品sss| 久久夜色精品亚洲噜噜国产mv | 狠狠爱www人成狠狠爱综合网| 亚洲天堂成人在线观看| 国产精品亚洲综合| 久久久久久亚洲精品中文字幕 | 亚洲欧美激情四射在线日 | 亚洲黄色在线| 在线午夜精品自拍| 亚洲精美视频| 亚洲欧美99| 一本久道久久综合中文字幕| 亚洲欧美日韩国产一区二区三区| 亚洲高清视频一区| 亚洲制服av| 99热精品在线| 久久在精品线影院精品国产| 亚洲综合电影一区二区三区| 久久一区二区精品| 久久精品论坛| 国产精品欧美风情| 亚洲欧洲日产国码二区| 黄色另类av| 亚洲欧美在线视频观看| 亚洲图片欧美日产| 欧美sm视频| 美乳少妇欧美精品| 狠狠色丁香婷婷综合久久片| 在线天堂一区av电影| 一区二区国产日产| 欧美超级免费视 在线| 久久夜色精品国产欧美乱极品| 国产精品毛片va一区二区三区 | 欧美中文字幕不卡| 欧美一区不卡| 国产精品每日更新在线播放网址| 日韩视频不卡中文| 亚洲深夜影院| 欧美日韩美女一区二区| 亚洲黄一区二区| 亚洲精品久久久久久久久久久| 久久久亚洲午夜电影| 久久久综合精品| 国产日韩欧美一区二区三区在线观看 | 一区二区在线视频播放| 久久精品动漫| 久色成人在线| 在线看无码的免费网站| 另类激情亚洲| 亚洲国产天堂网精品网站| 亚洲精品少妇30p| 欧美片网站免费| 99精品99| 欧美一区二区三区在线观看| 国产午夜久久| 久久久爽爽爽美女图片| 欧美国产日韩xxxxx| 亚洲日本欧美在线| 欧美日韩久久久久久| 亚洲午夜激情| 久久九九国产精品怡红院| 国产午夜精品视频| 免费观看在线综合| 亚洲美女视频在线观看| 亚洲欧美变态国产另类| 久久久久综合一区二区三区| 亚洲国产另类久久精品| 欧美日韩视频第一区| 先锋影音久久久| 欧美+日本+国产+在线a∨观看| 亚洲人成在线观看网站高清| 欧美日韩免费| 欧美一区二区三区视频在线观看| 美国成人毛片| 亚洲小说欧美另类婷婷| 国产一区导航| 欧美久久久久久| 午夜久久久久久| 亚洲电影免费观看高清| 亚洲欧美激情一区| 亚洲欧洲精品一区二区三区波多野1战4| 欧美激情视频一区二区三区在线播放 | 一区二区三区精品视频| 国产美女精品一区二区三区| 欧美成人午夜激情在线| 亚洲欧美成人一区二区在线电影| 另类激情亚洲| 羞羞视频在线观看欧美| 亚洲精品孕妇| 精品999日本| 国产精品v欧美精品v日韩精品| 久久久久久久综合狠狠综合| 一本一道久久综合狠狠老精东影业 | 亚洲精品一区在线观看| 国产精品综合| 欧美激情性爽国产精品17p| 亚洲天堂激情| 亚洲国产综合视频在线观看| 久久久777| 亚洲一区欧美一区| 亚洲国产精品va在线观看黑人| 国产精品xxx在线观看www| 免费看亚洲片| 亚洲一区二区三区高清| 亚洲第一精品久久忘忧草社区| 久久精品国产一区二区电影| 亚洲一区二区三区精品在线| 国产一区二区三区在线观看网站| 欧美午夜视频网站| 欧美日韩国产系列| 欧美丰满高潮xxxx喷水动漫| 久久伊人一区二区| 欧美一区午夜精品| 小黄鸭精品aⅴ导航网站入口 | 久久久久久网| 久久精品亚洲| 欧美在线观看www| 亚洲欧美在线网| 亚洲影音一区| 亚洲欧美日韩国产综合精品二区| 一本色道久久综合亚洲二区三区| 亚洲先锋成人| 亚洲一区二区三区中文字幕| 中文日韩在线| 亚洲婷婷综合久久一本伊一区| 夜夜嗨网站十八久久| 亚洲毛片一区| 99国产精品久久久| 亚洲午夜在线| 欧美一区二区日韩| 久久久www成人免费无遮挡大片 | 日韩图片一区| 一本大道久久a久久精品综合| 99国产欧美久久久精品| 中文一区二区在线观看| 午夜精品久久久久久99热软件| 欧美一区在线视频| 久久综合色综合88| 欧美国产日韩一区| 欧美日韩国语| 国产欧美日韩一区二区三区| 国产亚洲精品久久久| 激情综合色综合久久| 亚洲日本成人在线观看| 亚洲视频国产视频| 久久精品在线观看| 亚洲第一在线综合在线| 亚洲精品一品区二品区三品区| 亚洲特色特黄| 麻豆av福利av久久av| 欧美日韩另类一区| 国外视频精品毛片| 亚洲精品免费电影| 亚洲欧美日韩在线| 毛片基地黄久久久久久天堂| 日韩亚洲国产欧美| 久久久水蜜桃| 国产精品久久久久aaaa樱花| 国内精品久久久久久 | 羞羞答答国产精品www一本| 牛夜精品久久久久久久99黑人| 亚洲精品美女在线观看播放| 香蕉久久国产| 欧美精品一区二区三区久久久竹菊 | 国产精品亚洲аv天堂网| 有坂深雪在线一区| 亚洲视频综合| 免播放器亚洲| 国产精品99久久久久久www| 蜜臀av国产精品久久久久| 国产精品老牛| 亚洲美女中出| 久久视频精品在线| 夜夜嗨网站十八久久| 免费在线欧美视频| 国产亚洲欧美日韩一区二区| 一区二区三区久久网| 久久综合福利| 香蕉久久国产| 国产精品亚洲成人| 一区二区三区免费观看| 美女任你摸久久| 日韩午夜在线视频| 免费成人高清视频| 国产色综合久久| 亚洲午夜精品在线|