简答题
偏难
#17276
试题名称 :排兵布阵 时间限制 :1.0 s 内存限制 :512.0 MB
试题名称:排兵布阵
时间限制:1.0 s
内存限制:512.0 MB


答案与解析
正确答案:<pre class="brush:python;toolbar:false;">def largest_rect_area(heights):
stack = []
max_area = 0
# 末尾补0,强制弹出栈内所有元素
h = heights + [0]
for i in range(len(h)):
while stack and h[i] < h[stack[-1]]:
idx = stack.pop()
height = h[idx]
# 计算宽度
if not stack:
width = i
else:
width = i - stack[-1] - 1
area = height * width
if area > max_area:
max_area = area
stack.append(i)
return max_area
# 读取输入
n, m = map(int, input().split())
matrix = []
for _ in range(n):
row = list(map(int, input().split()))
matrix.append(row)
h = [0] * m
res = 0
for i in range(n):
# 更新高度数组
for j in range(m):
if matrix[i][j] != 0:
h[j] += 1
else:
h[j] = 0
# 求当前行柱状图最大矩形
current_max = largest_rect_area(h)
if current_max > res:
res = current_max
print(res)</pre>
这道题暂未补解析。