-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMain_85.java
More file actions
67 lines (58 loc) · 1.92 KB
/
Main_85.java
File metadata and controls
67 lines (58 loc) · 1.92 KB
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
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int matrix[][] = new int[n][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
matrix[i][j] = sc.nextInt();
}
}
// int [][] matrix= {{0,0},{1,0}};
/// System.out.println(matrix[0][0]);
// System.out.println(matrix[0][1]);System.out.println(matrix[1][0]);System.out.println(matrix[1][1]);
System.out.println(detectArea(matrix));
/* for (int i = 0; i < 2; i++) {
for (int j = 0; j < 2; j++) {
System.out.print(matrix[i][j] + " \t");
if(j==2-1)
System.out.println();
}
}*/
}
public static int detectArea(int[][] matrix) {
int length= matrix.length;
if(length == 0){
return 0;
}
int[][] n = new int[length][length];
int max = 0;
for(int i=0; i<length; i++){
for(int j=0; j<length; j++){
if(matrix[i][j] == 1){
if(j == 0){
n[i][j] = 1;
}else{
n [i][j] = n[i][j-1] + 1;
}
}
}
}
for(int i=0; i<length; i++){
for(int j=0; j<length; j++){
if(n[i][j] != 0){
int min = i;
int width = n[i][j];
while(min >= 0){
width = Math.min(width, n[min][j]);
int area = width * (i-min+1);
max = Math.max(max, area);
min--;
}
}
}
}
return max;
}
}