// 二叉堆 void up( int i ) { int dad = i >> 1,data = heap[i]; while( dad != 0 && heap[dad] > data ) { heap[i] = heap[dad]; i = dad; dad = i >> 1; } heap[i] = data; } void down( int i ) { int son = i << 1,data = heap[i]; while( son <= sum ) { if( son < sum && heap[son] > heap[son+1] ) son++; if( heap[son] >= data ) break; heap[i] = heap[son]; i = son; son = i << 1; } heap[i] = data; }
// 左偏树 int merge( int aa,int bb ) { if( !aa ) return bb; if( !bb ) return aa; if( key[aa] > key[bb] ) swap( aa,bb ); rt[aa] = merge( rt[aa],bb ); if( dis[ rt[aa] ] > dis[ lt[aa] ] ) swap( rt[aa],lt[aa] ); if( !rt[aa] ) dis[aa] = 0; else dis[aa] = dis[ rt[aa] ] + 1; return a; }
版权声明:本文内容由互联网用户自发贡献,该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容, 请发送邮件至 dio@foxmail.com 举报,一经查实,本站将立刻删除。