forked from MiYazJE/Acepta-el-reto
-
Notifications
You must be signed in to change notification settings - Fork 0
/
p283.java
70 lines (57 loc) · 1.93 KB
/
p283.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
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class p283 {
static int temp;
static int[] dirF = {1, 0, -1, 0};
static int[] dirC = {0, 1, 0, -1};
public static void dfs(int[][] grid, int f, int c, boolean[][] visited) {
if (f < 0 || c < 0 || f == grid.length || c == grid[0].length || visited[f][c] || grid[f][c] == 0) {
return;
}
temp++;
visited[f][c] = true;
int newF, newC;
for (int i = 0; i < 4; i++) {
newF = f + dirF[i];
newC = c + dirC[i];
dfs(grid, newF, newC, visited);
}
}
public static int maxPlot(int[][] grid) {
boolean[][] visited = new boolean[grid.length][grid[0].length];
int maxPlot = 0;
for (int i = 0; i < grid.length; i++) {
for (int j = 0; j < grid[0].length; j++) {
if (grid[i][j] == 1 && !visited[i][j]) {
temp = 0;
dfs(grid, i, j, visited);
maxPlot = Math.max(maxPlot, temp);
}
}
}
return maxPlot;
}
public static void main(String[] args) throws IOException {
final BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
int f, c;
int[][] m;
String input;
String[] inputs;
while (true) {
input = reader.readLine();
if (input == null) break;
inputs = input.split(" ");
f = Integer.parseInt(inputs[0]);
c = Integer.parseInt(inputs[1]);
m = new int[f][c];
for (int i = 0; i < f; i++) {
String line = reader.readLine();
for (int j = 0; j < c; j++) {
m[i][j] = line.charAt(j) == '#' ? 1: 0;
}
}
System.out.println(maxPlot(m));
}
}
}