Skip to content

Commit 2db3a52

Browse files
committed
[Week04] BOJ 14925: 목장 건설하기
1 parent 5ffcf52 commit 2db3a52

File tree

1 file changed

+35
-0
lines changed

1 file changed

+35
-0
lines changed
Lines changed: 35 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,35 @@
1+
package week04.BOJ_14925_목장건설하기;
2+
3+
import java.util.*;
4+
import java.lang.*;
5+
import java.io.*;
6+
7+
class BOJ14925 {
8+
public static void main(String[] args) throws IOException {
9+
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
10+
StringTokenizer st = new StringTokenizer(br.readLine());
11+
int M = Integer.parseInt(st.nextToken());
12+
int N = Integer.parseInt(st.nextToken());
13+
int[][] land = new int[M][N];
14+
int[][] dp = new int[M+1][N+1];
15+
int L = 0;
16+
17+
for (int i = 0; i < M; i++) {
18+
st = new StringTokenizer(br.readLine());
19+
for (int j = 0; j < N; j++) {
20+
land[i][j] = Integer.parseInt(st.nextToken());
21+
}
22+
}
23+
24+
int answer = 0;
25+
for (int i = 1; i <= M; i++) {
26+
for (int j = 1; j <= N; j++) {
27+
if (land[i-1][j-1] == 0) {
28+
dp[i][j] = Math.min(Math.min(dp[i-1][j], dp[i][j-1]), dp[i-1][j-1]) + 1; //위, 왼쪽, 왼쪽 위
29+
answer = Math.max(dp[i][j], answer);
30+
}
31+
}
32+
}
33+
System.out.println(answer);
34+
}
35+
}

0 commit comments

Comments
 (0)