-
Notifications
You must be signed in to change notification settings - Fork 0
/
1066.cpp
125 lines (98 loc) · 2.95 KB
/
1066.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
#include <cstdio>
#include <algorithm>
struct Node {
int data;
int h;
Node *lc, *rc;
Node(int x) : data(x) {
h = 0;
lc = rc = nullptr;
}
};
struct AVLTree {
Node *root;
AVLTree() {
this->root = nullptr;
}
int height(Node *x) {
if (x) return x->h;
else return -1;
}
Node *ll_Rotate(Node *r) {
// printf("**ll %d**\n", r->data);
Node *tmp = r->lc;
r->lc = tmp->rc;
tmp->rc = r;
r->h = std::max(height(r->lc), height(r->rc)) + 1;
tmp->h = std::max(height(tmp->lc), height(tmp->rc)) + 1;
return tmp;
}
Node *rr_Rotate(Node *r) {
// printf("**rr %d**\n", r->data);
Node *tmp = r->rc;
r->rc = tmp->lc;
tmp->lc = r;
r->h = std::max(height(r->lc), height(r->rc)) + 1;
tmp->h = std::max(height(tmp->lc), height(tmp->rc)) + 1;
return tmp;
}
Node *lr_Rotate(Node *r) {
// printf("**lr %d**\n", r->data);
r->lc = rr_Rotate(r->lc);
r = ll_Rotate(r);
return r;
}
Node *rl_Rotate(Node *r) {
// printf("**rl %d**\n", r->data);
r->rc = ll_Rotate(r->rc);
r = rr_Rotate(r);
return r;
}
Node* insertNode(int data, Node *root) {
if (!root) root = new Node(data);
else {
// printf("hihi\n");
if (data < root->data) {
// printf("haha\n");
root->lc = insertNode(data, root->lc);
// printf("*%d*\n", height(root->lc) - height(root->rc));
if (height(root->lc) - height(root->rc) == 2) {
if (data < root->lc->data) {
root = ll_Rotate(root);
} else {
root = lr_Rotate(root);
}
}
} else if (data > root->data) {
// printf("hoho\n");
root->rc = insertNode(data, root->rc);
// printf(".%d.\n", height(root->rc) - height(root->lc));
if (height(root->rc) - height(root->lc) == 2) {
if (data > root->rc->data) {
root = rr_Rotate(root);
} else {
root = rl_Rotate(root);
}
}
}
}
root->h = std::max(height(root->lc), height(root->rc)) + 1;
// printf("%d -> %d\n", root->data, root->h);
return root;
}
void insert(int data) {
this->root = insertNode(data, this->root);
}
};
int main() {
int n;
scanf("%d", &n);
AVLTree *avl = new AVLTree();
for (int i = 0; i < n; i++) {
int x;
scanf("%d", &x);
avl->insert(x);
}
printf("%d\n", avl->root->data);
return 0;
}