-
Notifications
You must be signed in to change notification settings - Fork 6
/
HyeKyoung.java
64 lines (57 loc) · 1.44 KB
/
HyeKyoung.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
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;
//빗물
public class HyeKyoung {
static class Height implements Comparable<Height>{
int h, idx;
public Height(int h, int idx) {
super();
this.h = h;
this.idx = idx;
}
@Override
public int compareTo(Height o) {
return o.h - this.h;
}
}
public static void main(String args[]) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer(br.readLine());
int H = Integer.parseInt(st.nextToken());
int W = Integer.parseInt(st.nextToken());
boolean[] visited = new boolean[W];
int sum = 0;
int[] blocks = new int[W];
Height[] block = new Height[W];
st = new StringTokenizer(br.readLine());
for(int i=0; i<W; i++) {
int h = Integer.parseInt(st.nextToken());
block[i] = new Height(h, i);
blocks[i] = h;
}
Arrays.sort(block);
for(int i=1; i<W; i++) {
int left, right;
int height = block[i].h;
if(block[i-1].idx < block[i].idx) {
left = block[i-1].idx;
right = block[i].idx;
}
else {
right = block[i-1].idx;
left = block[i].idx;
}
visited[left] = true;
visited[right] = true;
for(int j = left + 1; j<right; j++) {
if(visited[j]) continue;
sum+=height-blocks[j];
visited[j] = true;
}
}
System.out.println(sum);
}
}