摘要：
优先级队列: 1 #include 2 3 int A[100]; 4 int heapsize; 5 6 void swap(int i, int j) { 7 int temp = A[i]; 8 A[i] = A[j]; 9 A[j] = temp;10 }11 12 void huifu(int i){13 int maxheap = i;14 int l = 2*i;15 int r = 2*i + 1;16 if(l A[maxheap])17 maxheap = l;18 if(r A[ma... 阅读全文