摘要：//堆的尝试/*#include <iostream>#include <algorithm>using namespace std;const int MAX = 10;int cmp(int a,int b){ return a>b;}int main(){ int Array[MAX] = { 2,4,3,1,5,7,9,8,6,0}; make_heap(Array,Array + 5,cmp);//默认为最大堆 for(int i = 0;i < 5;i++) cout<<Array[i]<<" "; c 阅读全文
浙公网安备 33010602011771号