随笔分类 -  单调队列

POJ 3017 Cut the Sequence（单调队列+set）
摘要：Cut the SequenceTime Limit:2000MSMemory Limit:131072KTotal Submissions:7972Accepted:2287DescriptionGiven an integer sequence {an} of lengthN, you are to cut the sequence into several parts every one of which is a consecutive subsequence of the original sequence. Every part must satisfy that the sum 阅读全文

posted @ 2013-05-08 12:39 kuangbin 阅读(944) 评论(0) 推荐(0)

HDU 3530 Subsequence（单调队列）
摘要：SubsequenceTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3266Accepted Submission(s): 1063Problem DescriptionThere is a sequence of integers. Your task is to find the longest subsequence that satisfies the following condition: the difference betwe 阅读全文

posted @ 2013-05-08 00:04 kuangbin 阅读(972) 评论(0) 推荐(0)

HDU 3530 Subsequence（单调队列）
摘要：SubsequenceTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2641Accepted Submission(s): 869Problem DescriptionThere is a sequence of integers. Your task is to find the longest subsequence that satisfies the following condition: the difference betwee 阅读全文

posted @ 2012-08-30 16:00 kuangbin 阅读(1759) 评论(0) 推荐(0)

导航

JAVASCRIPT: