1.球场分块用DFS搜索 import sys try: while True: m,n=list(map(int, raw_input().split(','))) mat=[] for i in range(m): mat.append(map(int, raw_input().split(','))) def search(i,j): if i<0 or j<0 or i>=m or j>=n or mat[i][j]!=1: ...