【灌水】刚才听了一遍权振东的好声音现场《人质》# Music - 天籁之音
j*n
1 楼
有道题目最近频繁出现,特地总结一下常规解法以及它的变体。有个经典变体我还没看
到一个很经典的答案,希望有人补上,呵呵。
1. The largest rectangle under a histogram
http://www.informatik.uni-ulm.de/acm/Locals/2003/html/judge.html
Given: An integer array represents a histogram
Goal: Find the largest rectangle under the histogram.
Key observation: 输入为一个整数数组。如果某元素比它两边的邻居都小(比如Ai),
那么高度大于Ai的矩阵要么在该元素左边,要么在该元素右边,不可能穿过Ai。利用这
个性质,想办法遍历所有的矩形。
Complexity O(N) where N is the size of the given array.
2. Maximum subarray with all 1’s. (Generalization of problem 1)
http:
到一个很经典的答案,希望有人补上,呵呵。
1. The largest rectangle under a histogram
http://www.informatik.uni-ulm.de/acm/Locals/2003/html/judge.html
Given: An integer array represents a histogram
Goal: Find the largest rectangle under the histogram.
Key observation: 输入为一个整数数组。如果某元素比它两边的邻居都小(比如Ai),
那么高度大于Ai的矩阵要么在该元素左边,要么在该元素右边,不可能穿过Ai。利用这
个性质,想办法遍历所有的矩形。
Complexity O(N) where N is the size of the given array.
2. Maximum subarray with all 1’s. (Generalization of problem 1)
http: