Skip to content

Commit 5db55e1

Browse files
authored
Merge pull request #431 from AlgorithmWithGod/JHLEE325
[20250710] BOJ / G4 / 고층 건물 / 이준희
2 parents 13ca866 + 410b01a commit 5db55e1

File tree

2 files changed

+50
-0
lines changed

2 files changed

+50
-0
lines changed

JHLEE325/202507/.gitkeep

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1 @@
1+
Lines changed: 49 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,49 @@
1+
'''java
2+
import java.io.BufferedReader;
3+
import java.io.InputStreamReader;
4+
import java.util.StringTokenizer;
5+
6+
public class Main {
7+
public static void main(String[] args) throws Exception {
8+
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
9+
StringTokenizer st = new StringTokenizer(br.readLine());
10+
int n = Integer.parseInt(st.nextToken());
11+
12+
st = new StringTokenizer(br.readLine());
13+
14+
int[] buildings = new int[n];
15+
16+
for (int i = 0; i < n; i++) {
17+
buildings[i] = Integer.parseInt(st.nextToken());
18+
}
19+
20+
int max = 0;
21+
for (int i = 0; i < n; i++) {
22+
double temp = 1000000001;
23+
int count = 0;
24+
for (int j = i - 1; j >= 0; j--) {
25+
double degree = (double) (buildings[i] - buildings[j]) / (i - j);
26+
if (temp > degree) {
27+
count++;
28+
temp = degree;
29+
} else {
30+
continue;
31+
}
32+
}
33+
temp = -1000000001;
34+
for (int j = i + 1; j < n; j++) {
35+
double degree = (double) (buildings[j] - buildings[i]) / (j - i);
36+
if (temp < degree) {
37+
count++;
38+
temp = degree;
39+
} else {
40+
continue;
41+
}
42+
}
43+
max = Math.max(max, count);
44+
}
45+
46+
System.out.println(max);
47+
}
48+
}
49+
'''

0 commit comments

Comments
 (0)