最大连通分块 蓝桥杯模拟

小蓝有一个 30 行 60 列的数字矩阵，矩阵中的每个数都是 0 或 1 。如果从一个标为 1 的位置可以通过上下左右走到另一个标为 1 的位置，则称两个位置连通。与某一个标为 1 的位置连通的所有位置（包括自

己）组成一个连通分块。 请问矩阵中最大的连通分块有多大？

110010000011111110101001001001101010111011011011101001111110
010000000001010001101100000010010110001111100010101100011110
001011101000100011111111111010000010010101010111001000010100
101100001101011101101011011001000110111111010000000110110000
010101100100010000111000100111100110001110111101010011001011
010011011010011110111101111001001001010111110001101000100011
101001011000110100001101011000000110110110100100110111101011
101111000000101000111001100010110000100110001001000101011001
001110111010001011110000001111100001010101001110011010101110
001010101000110001011111001010111111100110000011011111101010
011111100011001110100101001011110011000101011000100111001011
011010001101011110011011111010111110010100101000110111010110
001110000111100100101110001011101010001100010111110111011011
111100001000001100010110101100111001001111100100110000001101
001110010000000111011110000011000010101000111000000110101101
100100011101011111001101001010011111110010111101000010000111
110010100110101100001101111101010011000110101100000110001010
110101101100001110000100010001001010100010110100100001000011
100100000100001101010101001101000101101000000101111110001010
101101011010101000111110110000110100000010011111111100110010
101111000100000100011000010001011111001010010001010110001010
001010001110101010000100010011101001010101101101010111100101
001111110000101100010111111100000100101010000001011101100001
101011110010000010010110000100001010011111100011011000110010
011110010100011101100101111101000001011100001011010001110011
000101000101000010010010110111000010101111001101100110011100
100011100110011111000110011001111100001110110111001001000111
111011000110001000110111011001011110010010010110101000011111
011110011110110110011011001011010000100100101010110000010011
010011110011100101010101111010001001001111101111101110011101

思路：求最大连通块，用DFS，将走过的块置‘0’，这样就不会重复走，一直DFS到没有路可走为止

，用一个res数组记录每个连通块的大小，选出最大的即可。注意：输入的是字符串，置‘0’和判断是否为‘1’时，要加‘’

mp=[]
for i in range(30):
  mp.append(list(input()))#输入的是字符串

def dfs(x,y):
    global c#定义全局变量c用来记录连通块数
    mp[x][y]='0'#直接将数字为一开始遍历的连通块置0防止重复遍历
    c+=1
    dir = [(-1,0),(1,0),(0,-1),(0,1)]
    for u,v in dir:
      nx,ny = x+u,y+v
      if 0<=nx<30 and 0<=ny<60 and mp[nx][ny]=='1':
          dfs(nx,ny)

res=0
for i in range(30):
  for j in range(60):
    if mp[i][j]=='1':
      c=0
      dfs(i,j)
      res=max(res,c)#比较出最大的连通块数
print(res)