
单调栈
clover_hxy
The secret oppotunities are hidden inside every failure....
展开
-
bzoj 1683: [Usaco2005 Nov]City skyline 城市地平线
1683: [Usaco2005 Nov]City skyline 城市地平线Time Limit: 5 Sec Memory Limit: 64 MBSubmit: 294 Solved: 247[Submit][Status][Discuss]DescriptionInput 第1行:2个用空格隔开的整数N和W. 第2到N+1行:每行包原创 2016-05-10 23:36:06 · 767 阅读 · 0 评论 -
bzoj 3879: SvT (后缀数组+单调栈)
3879: SvTTime Limit: 30 Sec Memory Limit: 512 MBSubmit: 546 Solved: 219[Submit][Status][Discuss]Description(我并不想告诉你题目名字是什么鬼)有一个长度为n的仅包含小写字母的字符串S,下标范围为[1,n].现在有若干组询问,对于每一个询问,我们给出若干个后缀原创 2017-01-12 08:05:14 · 616 阅读 · 0 评论 -
poj 3415 Common Substrings (后缀数组+单调栈)
Common SubstringsTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 10446 Accepted: 3444DescriptionA substring of a string T is defined as:T(i, k)=TiTi原创 2016-12-29 09:09:48 · 491 阅读 · 0 评论 -
poj 2559 Largest Rectangle in a Histogram
Largest Rectangle in a HistogramTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 18332 Accepted: 5891DescriptionA histogram is a polygon composed of a原创 2016-04-17 14:23:57 · 409 阅读 · 0 评论 -
bzoj 3956: Count (单调栈+st表)
3956: CountTime Limit: 10 Sec Memory Limit: 512 MBSubmit: 177 Solved: 103[Submit][Status][Discuss]DescriptionInputOutputSample Input3 2 02 1 21 11 3Sample O原创 2016-08-22 14:48:32 · 711 阅读 · 0 评论 -
bzoj 1657: [Usaco2006 Mar]Mooo 奶牛的歌声(单调栈)
1657: [Usaco2006 Mar]Mooo 奶牛的歌声Time Limit: 5 Sec Memory Limit: 64 MBSubmit: 643 Solved: 456[Submit][Status][Discuss]DescriptionFarmer John's N (1 <= N <= 50,000) cows are standing in a v原创 2016-05-03 08:50:04 · 398 阅读 · 0 评论 -
bzoj 1660: [Usaco2006 Nov]Bad Hair Day 乱发节(单调栈)
1660: [Usaco2006 Nov]Bad Hair Day 乱发节Time Limit: 2 Sec Memory Limit: 64 MBSubmit: 881 Solved: 421[Submit][Status][Discuss]DescriptionInput* Line 1: 牛的数量 N。 * Lines 2..N+1: 第 i+原创 2016-05-03 08:20:09 · 625 阅读 · 0 评论 -
bzoj 1345: [Baltic2007]序列问题Sequence(单调栈)
1345: [Baltic2007]序列问题SequenceTime Limit: 5 Sec Memory Limit: 162 MBSubmit: 734 Solved: 379[Submit][Status][Discuss]Description对于一个给定的序列a1, …, an,我们对它进行一个操作reduce(i),该操作将数列中的元素ai和ai+1用一个原创 2016-05-03 07:36:25 · 599 阅读 · 0 评论 -
bzoj 1113: [Poi2008]海报PLA
1113: [Poi2008]海报PLATime Limit: 10 Sec Memory Limit: 162 MBSubmit: 910 Solved: 584[Submit][Status][Discuss]DescriptionN个矩形,排成一排. 现在希望用尽量少的矩形海报Cover住它们.Input第一行给出数字N,代表有N个矩形.N在[1,原创 2016-05-02 22:49:28 · 725 阅读 · 0 评论 -
bzoj 4540: [Hnoi2016]序列 (莫队+ST表+单调栈|线段树)
题解传送门题目大意:给定长度为nn的序列:a1,a2,…,ana1,a2,…,an,记为a[1:n]a[1:n]。类似地,a[l:r](1≤l≤r≤N)a[l:r](1≤l≤r≤N)是指序列:al,al+1,…,ar−1,aral,al+1,…,ar-1,ar。若1≤l≤s≤t≤r≤n1≤l≤s≤t≤r≤n,则称a[s:t]a[s:t]是a[l:r]a[l:r]的子序列。现在有qq个询问,每个询问给原创 2017-03-07 21:50:23 · 929 阅读 · 0 评论