fork download 
  1. #include <stdio.h>
  2. #include <stdlib.h>
  3.  
  4. #define height 4
  5. #define MAX (1<<height)  //ビットシフト演算 2^height と同じ
  6.  
  7. int t[MAX+1]; //配列外アクセス防止のためのダミーで＋１
  8. int sz = 0;
  9.  
  10. void swap(int *x, int *y){
  11.     int tmp = *x;
  12.     *x = *y;
  13.     *y = tmp;
  14. }
  15.  
  16. void initTree(int n){
  17.     int i;
  18.     for(i=0;i<MAX;i++){
  19.         t[i] = -1;
  20.     }
  21. }
  22.  
  23. void printA(){
  24.     int i;
  25.     for(i=1;i<=sz;i++) printf("%d ",t[i]);
  26.     printf("\n");
  27. }
  28.  
  29. void printT(int i){
  30.     int x = i;
  31.     while(x/2!=0){
  32.         printf("  ");
  33.         x/=2;
  34.     }
  35.     printf("%d\n",t[i]);
  36. }
  37.  
  38. int goP(int i){
  39.     if(i/2 == 0) return 0;
  40.     else return i/2;
  41. }
  42.  
  43. int goL(int i){
  44.     if(2*i >= MAX) return 0;
  45.     else return 2*i;
  46. }
  47.  
  48. int goR(int i){
  49.     if(2*i+1 >= MAX) return 0;
  50.     else return 2*i+1;
  51. }
  52.  
  53. void preOrder(int i){
  54.     if(t[i] == -1) return;
  55.     printT(i);
  56.     preOrder(goL(i));
  57.     preOrder(goR(i));
  58. }
  59.  
  60. void inOrder(int i){
  61.     if(t[i] == -1) return;
  62.     inOrder(goL(i));
  63.     printT(i);
  64.     inOrder(goR(i));
  65. }
  66.  
  67. void postOrder(int i){
  68.     if(t[i] == -1) return;
  69.     postOrder(goL(i));
  70.     postOrder(goR(i));
  71.     printT(i);
  72. }
  73.  
  74. void insBT(int x){
  75.     int k,i = 1;
  76.     for(k=0;k<height;k++){
  77.         if(t[i]==-1){
  78.             t[i] = x;
  79.             sz++;
  80.             return;
  81.         }
  82.         if(x < t[i]) i = goL(i);
  83.         else i = goR(i);
  84.     }
  85.     printf("Error : too high -> %d\n",x);
  86. }
  87.  
  88. //先頭の要素を取り出す
  89. //ダウンヒープ
  90. void pushHeap(int x){
  91.     sz++;
  92.     t[sz] = x;
  93.  
  94.     int i = sz;
  95.     int p = goP(i);
  96.  
  97.     while(p != 0 && t[p] < t[i]){
  98.         swap(&t[p], &t[i]);
  99.         i = p;
  100.         p = goP(i);
  101.     }
  102. }
  103.  
  104.  
  105. //末尾に要素を追加する
  106. //アップヒープ
  107. int popHeap(){
  108.     if(sz == 0) return -1;
  109.  
  110.     int ret = t[1];
  111.  
  112.     t[1] = t[sz];
  113.     t[sz] = -1;
  114.     sz--;
  115.  
  116.     int i = 1;
  117.  
  118.     while(1){
  119.         int L = goL(i);
  120.         int R = goR(i);
  121.  
  122.         if(L == 0 || t[L] == -1) break;
  123.  
  124.         int larger = L;
  125.         if(R != 0 && t[R] != -1 && t[R] > t[L]){
  126.             larger = R;
  127.         }
  128.  
  129.         if(t[larger] > t[i]){
  130.             swap(&t[larger], &t[i]);
  131.             i = larger;
  132.         } else {
  133.             break;
  134.         }
  135.     }
  136.  
  137.     return ret;
  138. }
  139.  
  140. int main(void){
  141.     int i,x,n;
  142.     scanf("%d",&n);
  143.     // 木の初期化
  144.     initTree(n);
  145.     for(i=0;i<n;i++){
  146.         scanf("%d",&t[i+1]);
  147.     }
  148.     sz = n;
  149.     // 中間順で表示
  150. 	inOrder(1);
  151.  
  152. 	// pop
  153. 	int a=popHeap();
  154. 	printf("pop : %d\n",a);
  155. 	inOrder(1);
  156.  
  157. 	a = popHeap();
  158. 	printf("pop : %d\n",a);
  159.  
  160. 	inOrder(1);
  161.  
  162. 	printf("push : 100\n");
  163. 	pushHeap(100);
  164. 	inOrder(1);
  165.  
  166. 	printf("push : 30\n");
  167. 	pushHeap(30);
  168. 	inOrder(1);
  169.     return 0;
  170. }
  171.  
Success #stdin #stdout 0s 5320KB
comments (?)
stdin 
12
89 34 55 13 16 21 32 2 3 4 5 8
stdout 
      2
    13
      3
  34
      4
    16
      5
89
      8
    21
  55
    32
pop : 89
      2
    13
      3
  34
      4
    16
      5
55
    21
  32
    8
pop : 55
      2
    13
      3
  16
      4
    5
34
    21
  32
    8
push : 100
      2
    13
      3
  34
      4
    16
      5
100
    21
  32
    8
push : 30
      2
    13
      3
  34
      4
    16
      5
100
      21
    30
  32
    8
https://ideone.com/SX3VIa
language:
C (gcc 8.3)
created:
5 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!