Submission #73144682

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <stdio.h>
int m;
int n;
int hh[128][128]; /* haku hyou */
int tiisakunaihou(int a, int b) {
  return a >= b ? a : b;
}
int idou(int y, int x) {
  int ans;
  if (hh[y][x] == 0) return 0;
  hh[y][x] = 0;
  ans = idou(y - 1, x);
  ans = tiisakunaihou(ans, idou(y + 1, x));
  ans = tiisakunaihou(ans, idou(y, x - 1));
  ans = tiisakunaihou(ans, idou(y, x + 1));
  hh[y][x] = 1;
  return ans + 1;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <stdio.h>

int m;
int n;
int hh[128][128]; /* haku hyou */

int tiisakunaihou(int a, int b) {
	return a >= b ? a : b;
}

int idou(int y, int x) {
	int ans;
	if (hh[y][x] == 0) return 0;
	hh[y][x] = 0;
	ans = idou(y - 1, x);
	ans = tiisakunaihou(ans, idou(y + 1, x));
	ans = tiisakunaihou(ans, idou(y, x - 1));
	ans = tiisakunaihou(ans, idou(y, x + 1));
	hh[y][x] = 1;
	return ans + 1;
}

int main(void) {
	int i, j;
	int ans = 0;
	if (scanf("%d", &m) != 1) return 1;
	if (scanf("%d", &n) != 1) return 1;
	for (i = 1; i <= n; i++) {
		for (j = 1; j <= m; j++) {
			if (scanf("%d", &hh[i][j]) != 1) return 1;
		}
	}
	for (i = 1; i <= n; i++) {
		for (j = 1; j <= m; j++) {
			ans = tiisakunaihou(ans, idou(i, j));
		}
	}
	printf("%d\n", ans);
	return 0;
}

Submission Info

Judge Result