Poj 3481 hdu1908 Double Queue SBT

Simple balanced binary tree question, supports three operations, insert, query the most value, delete, use Operator Overloading in the struct, for encoding convenience, if you do not need to overload, it should run faster.

 

MyCode:

# Include <cstdio> <br/> # include <cstring> <br/> # include <cstdlib> <br/> # include <algorithm> <br/> using namespace STD; <br/> const int max = 1100000; <br/> struct in {<br/> int ID; <br/> int pro; </P> <p> in () {}< br/> in (int id, int Pro): ID (ID), Pro (Pro) {}< br/> bool operator ==( const in & in) const {<br/> return id = in. ID & Pro = in. pro; <br/>}</P> <p> bool operator <(const in & in) const {<br/> If (pro! = In. pro) {<br/> return pro <in. pro; <br/>}else {<br/> return id <in. ID; <br/>}</P> <p> bool operator <= (const in & in) const {<br/> return * THIS <in | * This = in; <br/>}</P> <p> bool operator> (const in & in) const {<br/> return! (* THIS <= In); <br/>}</P> <p> bool operator >=( const in & in) const {<br/> return! (* THIS <in); <br/>}< br/>}; <br/> struct node {<br/> int left, right, size, CNT; <br/> in key; <br/> void Init () {<br/> left = right = 0; <br/> size = 1; <br/>}< br/>} node [Max]; <br/> int tol; <br/> int root; <br/> void Init () {<br/> Tol = root = 0; <br/>}< br/> void LT (Int & T) <br/> {<br/> int K = node [T]. right; <br/> node [T]. right = node [K]. left; <br/> node [K]. left = T; <br/> node [K]. size = node [T]. size; <Br/> node [T]. size = node [node [T]. left]. size + node [node [T]. right]. size + 1; <br/> T = K; <br/> return; <br/>}< br/> void RT (Int & T) {<br/> int K = node [T]. left; <br/> node [T]. left = node [K]. right; <br/> node [K]. right = T; <br/> node [K]. size = node [T]. size; <br/> node [T]. size = node [node [T]. left]. size + node [node [T]. right]. size + 1; <br/> T = K; <br/> return; <br/>}< br/> void keep (Int & T, bool fl AG) {<br/> If (flag = 0) {<br/> If (node [node [T]. left]. left]. size> node [node [T]. right]. size) <br/> RT (t); <br/> else if (node [node [T]. left]. right]. size> node [node [T]. right]. size) {<br/> LT (node [T]. left); <br/> RT (t); <br/>} else return; <br/>} else {<br/> If (node [node [T]. right]. right]. size> node [node [T]. left]. size) <br/> LT (t); <br/> else if (node [node [T]. right]. left ]. Size> node [node [T]. left]. size) {<br/> RT (node [T]. right); <br/> LT (t); <br/>} else return; <br/>}< br/> keep (node [T]. left, 0); <br/> keep (node [T]. right, 1); <br/> keep (T, 0); <br/> keep (T, 1); <br/> return; <br/>}< br/> void insert (Int & T, const in & V) {<br/> If (t = 0) {<br/> T = ++ tol; <br/> node [T]. init (); <br/> node [T]. key = V; <br/>}else {<br/> node [T]. size ++; <br/> If (v <node [T]. Key) <br/> insert (node [T]. left, V); <br/> else insert (node [T]. right, V); <br/> keep (T, V> = node [T]. key); <br/>}< br/> return; <br/>}< br/> int del (Int & T, const in & V) {<br/> If (! T) <br/> return 0; <br/> node [T]. size --; <br/> If (V = node [T]. key | V <node [T]. key &&! Node [T]. Left | V> node [T]. Key &&! Node [T]. right) {<br/> If (node [T]. left & node [T]. right) {<br/> int P = del (node [T]. left, in (v. ID + 1, V. pro); <br/> node [T]. key = node [p]. key; <br/> return P; <br/>} else {<br/> int P = T; <br/> T = node [T]. left + node [T]. right; <br/> return P; <br/>}< br/>} else return del (v <node [T]. key? Node [T]. left: node [T]. right, V); <br/>}< br/> in select (int t, int K) {<br/> If (k <= node [node [T]. left]. size) <br/> return select (node [T]. left, k); <br/> else if (k> node [node [T]. left]. size + 1) <br/> return select (node [T]. right, K-node [node [T]. left]. size-1); <br/> return node [T]. key; <br/>}< br/> int getmax (INT t) {<br/> while (node [T]. right) <br/> T = node [T]. right; <br/> return t; <br/>}< br/> int getmin (INT t) {<br/> while (node [T]. left) <br/> T = node [T]. left; <br/> return t; <br/>}< br/> int main () {<br/> int ID, Pro; </P> <p> Init (); <br/> while (scanf ("% d", & ID), ID) {<br/> If (ID = 1) {<br/> scanf ("% d", & ID, & Pro ); <br/> insert (root, in (ID, Pro); <br/>} else if (ID = 2) {<br/> If (Tol = 0) {<br/> puts ("0 "); <br/>} else {<br/> id = getmax (Root); <br/> printf ("% d/N", node [ID]. key. ID); <br/> Del (root, node [ID]. key); <br/>}< br/>}else {<br/> If (Tol = 0) {<br/> puts ("0 "); <br/>} else {<br/> id = getmin (Root); <br/> printf ("% d/N", node [ID]. key. ID); <br/> Del (root, node [ID]. key); <br/>}</P> <p> return 0; <br/>}< br/>