def max_consecutive_boys(matrix, rows, cols):max_count = 0# 检查水平方向for i in range(rows):count = 0for j in range(cols):if matrix[i][j] == 'M':count += 1max_count = max(max_count, count)else:count = 0# 检查垂直方向for j in range(cols):count = 0for i in range(rows):if matrix[i][j] == 'M':count += 1max_count = max(max_count, count)else:count = 0# 检查对角线方向（从左上到右下）for i in range(rows):for j in range(cols):count = 0x, y = i, jwhile x = 0:if matrix[x][y] == 'M':count += 1max_count = max(max_count, count)else:count = 0x += 1y -= 1return max_count# 自定义输入rows, cols = map(int, input("请输入矩阵的行数和列数（用逗号分隔）: ").split(','))matrix = for i in range(rows):row = input(f"请输入第 {i + 1} 行的矩阵内容（用逗号分隔）: ").strip.split(',')matrix.append(row)# 计算最长的位置相连的男生个数result = max_consecutive_boys(matrix, rows, cols)print(result)摘要：def max_consecutive_boys(matrix, rows, cols):max_count = 0# 检查水平方向for i in range(rows):count = 0for j in range(cols):if matrix[i][
来源：一百教育
