
单调栈
Stephencurry‘s csdn
这个作者很懒,什么都没留下…
展开
-
Skyscrapers (hard version) (CodeForces-1313C2)(单调栈)
This is a harder version of the problem. In this versionn≤500000n≤500000 The outskirts of the capital are being actively built up in Berland. The company "Kernel Panic" manages the construction of a...原创 2020-03-19 11:32:30 · 247 阅读 · 0 评论 -
Largest Rectangle in a Histogram (POJ-2559)(单调栈)
A histogram is a polygon composed of a sequence of rectangles aligned at a common base line. The rectangles have equal widths but may have different heights. For example, the figure on the left shows ...原创 2019-07-31 09:20:26 · 140 阅读 · 0 评论