fork download
copy 
  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. int popHeap(){
  89. 	int i=1;
  90. 	int l,r,ma;
  91. 	int ret=t[i];
  92. 	t[i]=t[sz];
  93. 	t[sz--]=-1;
  94. 	while(i*2<=sz){
  95. 		l=goL(i);
  96. 		r=goR(i);
  97. 		if(t[l]<t[r]) ma=r;
  98. 		else ma=l;
  99. 		if(t[i]>t[ma]) break;
  100. 		swap(&t[i],&t[ma]);
  101. 		i=ma;
  102. 	}
  103. 	return ret;
  104. }
  105.  
  106. void pushHeap(int x){
  107. 	int i=++sz;
  108. 	int p;
  109. 	if(i>=MAX-1){
  110. 		printf("Error : out size <%d - > %d\n",MAX-1,i);
  111. 		t[sz]=-1;
  112. 		sz--;
  113. 		return ;
  114. 	}
  115. 	t[sz]=x;
  116. 	while(1<i){
  117. 		p=goP(i);
  118. 		if(t[i]<=t[p]) return ;
  119. 		else swap(&t[i],&t[p]);
  120. 		i=p;
  121. 	}
  122. }
  123.  
  124. int main(void){
  125.     int i,x,n;
  126.     scanf("%d",&n);
  127.     // 木の初期化
  128.     initTree(n);
  129.     for(i=0;i<n;i++){
  130.         scanf("%d",&t[i+1]);
  131.     }
  132.     sz = n;
  133.     // 中間順で表示
  134. 	inOrder(1);
  135.  
  136. 	// pop
  137. 	int a=popHeap();
  138. 	printf("pop : %d\n",a);
  139. 	inOrder(1);
  140.  
  141. 	a = popHeap();
  142. 	printf("pop : %d\n",a);
  143.  
  144. 	inOrder(1);
  145.  
  146. 	printf("push : 100\n");
  147. 	pushHeap(100);
  148. 	inOrder(1);
  149.  
  150. 	printf("push : 30\n");
  151. 	pushHeap(30);
  152. 	inOrder(1);
  153.     return 0;
  154. }
Success #stdin #stdout 0s 5272KB
comments (?)
stdin
copy 
12
89
34
55
13
16
21
32
2
3
4
5
8
stdout
copy 
      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/DuPC0K
language:
C (gcc 8.3)
created:
13 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!