单调栈
NimoXie
做做笔记做做总结,欢迎一起讨论、学习、进步!
展开
-
HDU杭电 3530 (fjutacm 1920) Subsequence 单调栈
Problem Description There is a sequence of integers. Your task is to find the longest subsequence that satisfies the following condition: the difference between the maximum element and the minimum ele...原创 2019-08-14 11:32:17 · 126 阅读 · 0 评论 -
HDU杭电 1506 (fjutacm 1899) Largest Rectangle in a Histogram 单调栈
Problem Description 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 figur...原创 2019-08-15 16:04:59 · 170 阅读 · 0 评论