特殊技巧
特殊技巧算法
lwgkzl
海风和着歌声,星空伴着代码
展开
-
Jessica's Reading Problem poj3320(尺取法 +测试数据)
Jessica's Reading ProblemTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11226 Accepted: 3777DescriptionJessica's a very lovely girl wooed by lots of原创 2016-12-20 20:36:12 · 420 阅读 · 0 评论 -
Subsequence poj3061(尺取法)
SubsequenceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 13114 Accepted: 5537DescriptionA sequence of N positive integers (10 < N < 100 000), each o原创 2016-12-20 20:40:35 · 290 阅读 · 0 评论 -
Trouble HDU - 4334
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6206 Accepted Submission(s): 1732Problem DescriptionHassan is in trouble. His原创 2017-08-08 09:47:42 · 278 阅读 · 0 评论 -
Largest Rectangle in a Histogram POJ2559(单调栈模板)
题目如下: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 le原创 2017-07-24 11:57:59 · 344 阅读 · 0 评论 -
leetcode.76. 最小覆盖子串(双指针法)
题目:给定一个字符串 S 和一个字符串 T,请在 S 中找出包含 T 所有字母的最小子串。示例:输入: S = "ADOBECODEBANC", T = "ABC"输出: "BANC"说明:如果 S 中不存这样的子串,则返回空字符串 ""。 如果 S 中存在这样的子串,我们保证它是唯一的答案。坑点:1.在S中找到包含T中所有字母的子串,这个子串并不仅仅是要包含所有T...原创 2018-08-04 13:04:17 · 1278 阅读 · 0 评论