-
Notifications
You must be signed in to change notification settings - Fork 22
/
bst.java
132 lines (117 loc) · 3.11 KB
/
bst.java
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
126
127
128
129
130
131
132
import java.io.*;
import java.util.*;
public class bst {
private static Reader in;
private static PrintWriter out;
private static int [] tree;
public static void main (String [] args) throws IOException {
in = new Reader ();
out = new PrintWriter (System.out, true);
int N = in.nextInt();
TreeSet <Integer> set = new TreeSet <Integer> ();
long moves = 0;
tree = new int [N + 1];
for (int i = 0; i < N; i++) {
int cur = in.nextInt();
Integer upper = set.higher (cur);
Integer lower = set.lower (cur);
if (upper == null) upper = N;
if (lower == null) lower = 1;
moves += query (cur);
update (upper + 1, -1);
update (lower, 1);
set.add (cur);
out.println (moves);
}
out.close();
System.exit(0);
}
private static int query (int pos) {
int sum = 0;
for (int i = pos; i > 0; i -= (i & -i))
sum += tree [i];
return sum;
}
private static void update (int pos, int val) {
for (int i = pos; i < tree.length; i += (i & -i))
tree [i] += val;
}
static class Reader {
final private int BUFFER_SIZE = 1 << 16;
private DataInputStream din;
private byte [] buffer;
private int bufferPointer, bytesRead;
public Reader () {
din = new DataInputStream (System.in);
buffer = new byte[BUFFER_SIZE];
bufferPointer = bytesRead = 0;
}
public Reader (String file_name) throws IOException {
din = new DataInputStream (new FileInputStream (file_name));
buffer = new byte[BUFFER_SIZE];
bufferPointer = bytesRead = 0;
}
public String readLine () throws IOException {
byte [] buf = new byte[1024];
int cnt = 0, c;
while ((c = read ()) != -1) {
if (c == '\n') break;
buf[cnt++] = (byte) c;
}
return new String (buf, 0, cnt);
}
public int nextInt () throws IOException {
int ret = 0;
byte c = read ();
while (c <= ' ')
c = read ();
boolean neg = (c == '-');
if (neg) c = read ();
do {
ret = ret * 10 + c - '0';
} while ((c = read ()) >= '0' && c <= '9');
if (neg) return -ret;
return ret;
}
public long nextLong () throws IOException {
long ret = 0;
byte c = read ();
while (c <= ' ')
c = read ();
boolean neg = (c == '-');
if (neg) c = read ();
do {
ret = ret * 10 + c - '0';
} while ((c = read ()) >= '0' && c <= '9');
if (neg) return -ret;
return ret;
}
public double nextDouble () throws IOException {
double ret = 0, div = 1;
byte c = read ();
while (c <= ' ')
c = read ();
boolean neg = (c == '-');
if (neg) c = read ();
do {
ret = ret * 10 + c - '0';
} while ((c = read ()) >= '0' && c <= '9');
if (c == '.') while ((c = read ()) >= '0' && c <= '9')
ret += (c - '0') / (div *= 10);
if (neg) return -ret;
return ret;
}
private void fillBuffer () throws IOException {
bytesRead = din.read (buffer, bufferPointer = 0, BUFFER_SIZE);
if (bytesRead == -1) buffer[0] = -1;
}
private byte read () throws IOException {
if (bufferPointer == bytesRead) fillBuffer ();
return buffer[bufferPointer++];
}
public void close () throws IOException {
if (din == null) return;
din.close ();
}
}
}