[kuangbin带你飞]专题二十四二分尺取单调栈队列 [Cloned]

Begin: 1532062800000

[kuangbin带你飞]专题二十四二分尺取单调栈队列 [Cloned]

End: 1537246800000

Elapsed:

Remaining:

#	Origin	Title
A	CodeForces 371C	Hamburgers
B	CodeForces 343C	Read Time
C	POJ 3685	Matrix
D	POJ 3104	Drying
E	POJ 3258	River Hopscotch
F	POJ 3122	Pie
G	HDU 4768	Flyer
H	HDU 2289	Cup
I	HDU 5493	Queue
J	HDU 4190	Distributing Ballot Boxes
K	HDU 5646	DZY Loves Partition
L	HDU 5256	序列变换
M	HDU 3244	Inviting Friends
N	POJ 2566	Bound Found
O	POJ 3061	Subsequence
P	POJ 2100	Graveyard Design
Q	POJ 2739	Sum of Consecutive Prime Numbers
R	HDU 5672	String
S	HDU 5178	pairs
T	HDU 5358	First One
U	HDU 1937	Finding Seats
V	HDU 3415	Max Sum of Max-K-sub-sequence
W	HDU 3410	Passing the Message
X	HDU 4122	Alice's mooncake shop
Y	HDU 1506	Largest Rectangle in a Histogram

Status

My Status

Translate

PDF

Select a statement for participants:

Run ID	Username	Prob	Result	Time (ms)	Mem (MB)	Length	Lang	Submit Time

{"id":239746,"title":"[kuangbin带你飞]专题二十四  二分 尺取 单调栈队列 [Cloned]","type":0,"openness":0,"authStatus":1,"begin":1532062800000,"end":1537246800000,"createTime":1532061276000,"started":true,"ended":true,"managerId":116910,"managerName":"dw010203","fav":false,"description":{"format":"HTML","content":"[Cloned from \u003ca href\u003d\u0027https://vjudge.net/contest/202464\u0027 target\u003d\u0027_blank\u0027\u003e[kuangbin带你飞]专题二十四  二分 尺取 单调栈队列 [Cloned]\u003c/a\u003e]"},"announcement":"","problems":[{"pid":48552,"title":"Hamburgers","oj":"CodeForces","probNum":"371C","num":"A","publicDescId":3198482657266742,"publicDescVersion":1713803386000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"262144 kB","spoiler":false},{"title":"Source","content":"\u003ca style\u003d\"color: black\" href\u003d\"https://codeforces.com/contest/371\"\u003eCodeforces Round 218 (Div. 2)\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"\r\n    binary search\r\n\n\r\n    brute force\r\n\n\r\n    *1600\r\n","spoiler":true},{"title":"Editorial","content":"\u003ca href\u003d\"https://codeforces.com/blog/entry/9871\" title\u003d\"Codeforces Round #218 (Div. 2)\" target\u003d\"_blank\"\u003eAnnouncement\u003c/a\u003e\n\u003ca href\u003d\"https://codeforces.com/blog/entry/9876\" title\u003d\"Codeforces Round #218 (Div. 2): Tutorial\" target\u003d\"_blank\"\u003eTutorial\u003c/a\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","languages":{"88":"Kotlin 1.9.21","89":"GNU G++20 13.2 (64 bit, winlibs)","67":"Ruby 3.2.2","28":"D DMD32 v2.105.0","70":"PyPy 3.10 (7.3.15, 64bit)","50":"GNU G++14 6.4.0","51":"PascalABC.NET 3.8.3","31":"Python 3.8.10","75":"Rust 1.75.0 (2021)","54":"GNU G++17 7.3.0","32":"Go 1.22.2","55":"Node.js 15.8.0 (64bit)","12":"Haskell GHC 8.10.1","34":"JavaScript V8 4.8.0","79":"C# 10, .NET SDK 6.0","13":"Perl 5.20.1","36":"Java 8 32bit","19":"OCaml 4.02.1","3":"Delphi 7","4":"Free Pascal 3.2.2","6":"PHP 8.1.7","7":"Python 2.7.18","9":"C# Mono 6.8","83":"Kotlin 1.7.20","40":"PyPy 2.7.13 (7.3.0)","41":"PyPy 3.6.9 (7.3.0)","20":"Scala 2.12.8","43":"GNU GCC C11 5.1.0","65":"C# 8, .NET Core 3.1","87":"Java 21 64bit"},"submitMethods":[true,true,true]},{"pid":47564,"title":"Read Time","oj":"CodeForces","probNum":"343C","num":"B","publicDescId":3193168013027694,"publicDescVersion":1713654072000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"262144 kB","spoiler":false},{"title":"Source","content":"\u003ca style\u003d\"color: black\" href\u003d\"https://codeforces.com/contest/343\"\u003eCodeforces Round 200 (Div. 1)\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"\r\n    binary search\r\n\n\r\n    greedy\r\n\n\r\n    two pointers\r\n\n\r\n    *1900\r\n","spoiler":true},{"title":"Editorial","content":"\u003ca href\u003d\"https://codeforces.com/blog/entry/8860\" title\u003d\"Codeforces Round #200 Tutorial\" target\u003d\"_blank\"\u003eTutorial\u003c/a\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","languages":{"88":"Kotlin 1.9.21","89":"GNU G++20 13.2 (64 bit, winlibs)","67":"Ruby 3.2.2","28":"D DMD32 v2.105.0","70":"PyPy 3.10 (7.3.15, 64bit)","50":"GNU G++14 6.4.0","51":"PascalABC.NET 3.8.3","31":"Python 3.8.10","75":"Rust 1.75.0 (2021)","54":"GNU G++17 7.3.0","32":"Go 1.22.2","55":"Node.js 15.8.0 (64bit)","12":"Haskell GHC 8.10.1","34":"JavaScript V8 4.8.0","79":"C# 10, .NET SDK 6.0","13":"Perl 5.20.1","36":"Java 8 32bit","19":"OCaml 4.02.1","3":"Delphi 7","4":"Free Pascal 3.2.2","6":"PHP 8.1.7","7":"Python 2.7.18","9":"C# Mono 6.8","83":"Kotlin 1.7.20","40":"PyPy 2.7.13 (7.3.0)","41":"PyPy 3.6.9 (7.3.0)","20":"Scala 2.12.8","43":"GNU GCC C11 5.1.0","65":"C# 8, .NET Core 3.1","87":"Java 21 64bit"},"submitMethods":[true,true,true]},{"pid":24239,"title":"Matrix","oj":"POJ","probNum":"3685","num":"C","publicDescId":3102302067327007,"publicDescVersion":1713493438000,"properties":[{"title":"Time limit","content":"6000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\u003ca href\u003d\"http://poj.org/searchproblem?field\u003dsource\u0026amp;key\u003dPOJ+Founder+Monthly+Contest+%E2%80%93+2008.08.31\"\u003ePOJ Founder Monthly Contest – 2008.08.31\u003c/a\u003e, windy7926778\r\u003cbr\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":16416,"title":"Drying","oj":"POJ","probNum":"3104","num":"D","publicDescId":3151104320944004,"publicDescVersion":1714008630000,"properties":[{"title":"Time limit","content":"2000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\u003ca href\u003d\"http://poj.org/searchproblem?field\u003dsource\u0026amp;key\u003dNortheastern+Europe+2005\"\u003eNortheastern Europe 2005\u003c/a\u003e, Northern Subregion\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":16277,"title":"River Hopscotch","oj":"POJ","probNum":"3258","num":"E","publicDescId":3150124234470993,"publicDescVersion":1713704919000,"properties":[{"title":"Time limit","content":"2000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\u003ca href\u003d\"http://poj.org/searchproblem?field\u003dsource\u0026amp;key\u003dUSACO+2006+December+Silver\"\u003eUSACO 2006 December Silver\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":17088,"title":"Pie","oj":"POJ","probNum":"3122","num":"F","publicDescId":3153353768900384,"publicDescVersion":1713964960000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"Special judge","content":"\u003cspan style\u003d\u0027color:red\u0027\u003eYes\u003c/span\u003e","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\u003ca href\u003d\"http://poj.org/searchproblem?field\u003dsource\u0026amp;key\u003dNorthwestern+Europe+2006\"\u003eNorthwestern Europe 2006\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":46831,"title":"Flyer","oj":"HDU","probNum":"4768","num":"G","publicDescId":3173193597756312,"publicDescVersion":1713708755000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"32768 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003d2013+ACM%2FICPC+Asia+Regional+Changchun+Online\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2013 ACM/ICPC Asia Regional Changchun Online \u003c/a\u003e \u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":15721,"title":"Cup","oj":"HDU","probNum":"2289","num":"H","publicDescId":3165252007614618,"publicDescVersion":1713647261000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"32768 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003dThe+4th+Baidu+Cup+final\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e The 4th Baidu Cup final \u003c/a\u003e \u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":248747,"title":"Queue","oj":"HDU","probNum":"5493","num":"I","publicDescId":3246862555159321,"publicDescVersion":1713730169000,"properties":[{"title":"Time limit","content":"2000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003d2015+ACM%2FICPC+Asia+Regional+Hefei+Online\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2015 ACM/ICPC Asia Regional Hefei Online \u003c/a\u003e \u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":27493,"title":"Distributing Ballot Boxes","oj":"HDU","probNum":"4190","num":"J","publicDescId":3127818905816331,"publicDescVersion":1713639180000,"properties":[{"title":"Time limit","content":"10000 ms","spoiler":false},{"title":"Mem limit","content":"32768 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003dSWERC+2011\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e SWERC 2011 \u003c/a\u003e \u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":343812,"title":"DZY Loves Partition","oj":"HDU","probNum":"5646","num":"K","publicDescId":3264614587896873,"publicDescVersion":1713709599000,"properties":[{"title":"Time limit","content":"2000 ms","spoiler":false},{"title":"Mem limit","content":"262144 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003dBestCoder+Round+%2376+%28div.2%29\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e BestCoder Round #76 (div.2) \u003c/a\u003e \u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":177849,"title":"序列变换","oj":"HDU","probNum":"5256","num":"L","publicDescId":3299176657482508,"publicDescVersion":1713730413000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"32768 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003d2015%C4%EA%B0%D9%B6%C8%D6%AE%D0%C7%B3%CC%D0%F2%C9%E8%BC%C6%B4%F3%C8%FC+-+%B3%F5%C8%FC%282%29\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2015年百度之星程序设计大赛 - 初赛(2) \u003c/a\u003e \u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":13378,"title":"Inviting Friends","oj":"HDU","probNum":"3244","num":"M","publicDescId":3163865863654580,"publicDescVersion":1713632890000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"32768 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003d2009+%A1%B0NIT+Cup%A1%B1+National+Invitational+Contest\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2009 “NIT Cup” National Invitational Contest \u003c/a\u003e \u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":39361,"title":"Bound Found","oj":"POJ","probNum":"2566","num":"N","publicDescId":3219773680689802,"publicDescVersion":1713709659000,"properties":[{"title":"Time limit","content":"5000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"Special judge","content":"\u003cspan style\u003d\u0027color:red\u0027\u003eYes\u003c/span\u003e","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\u003ca href\u003d\"http://poj.org/searchproblem?field\u003dsource\u0026amp;key\u003dUlm+Local+2001\"\u003eUlm Local 2001\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":21444,"title":"Subsequence","oj":"POJ","probNum":"3061","num":"O","publicDescId":3110202258371776,"publicDescVersion":1713785551000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\u003ca href\u003d\"http://poj.org/searchproblem?field\u003dsource\u0026amp;key\u003dSoutheastern+Europe+2006\"\u003eSoutheastern Europe 2006\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":39270,"title":"Graveyard Design","oj":"POJ","probNum":"2100","num":"P","publicDescId":3221154243059565,"publicDescVersion":1713603212000,"properties":[{"title":"Time limit","content":"10000 ms","spoiler":false},{"title":"Case time limit","content":"2000 ms","spoiler":false},{"title":"Mem limit","content":"64000 kB","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\u003ca href\u003d\"http://poj.org/searchproblem?field\u003dsource\u0026amp;key\u003dNortheastern+Europe+2004\"\u003eNortheastern Europe 2004\u003c/a\u003e, Northern Subregion\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":18023,"title":"Sum of Consecutive Prime Numbers","oj":"POJ","probNum":"2739","num":"Q","publicDescId":3153874525862581,"publicDescVersion":1713793156000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\u003ca href\u003d\"http://poj.org/searchproblem?field\u003dsource\u0026amp;key\u003dJapan+2005\"\u003eJapan 2005\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":368976,"title":"String","oj":"HDU","probNum":"5672","num":"R","publicDescId":3269185582176041,"publicDescVersion":1713935768000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003dBestCoder+Round+%2381+%28div.2%29\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e BestCoder Round #81 (div.2) \u003c/a\u003e \u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":127164,"title":"pairs","oj":"HDU","probNum":"5178","num":"S","publicDescId":3277993583631890,"publicDescVersion":1713632182000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"32768 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003dBestCoder+Round+%2331\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e BestCoder Round #31 \u003c/a\u003e \u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":215753,"title":"First One","oj":"HDU","probNum":"5358","num":"T","publicDescId":3290468895446504,"publicDescVersion":1713687440000,"properties":[{"title":"Time limit","content":"10000 ms","spoiler":false},{"title":"Mem limit","content":"131072 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003d2015+Multi-University+Training+Contest+6\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2015 Multi-University Training Contest 6 \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003ezimpha@zju\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":40873,"title":"Finding Seats","oj":"HDU","probNum":"1937","num":"U","publicDescId":3223985672782305,"publicDescVersion":1713678645000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"32768 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003dACM+South+American+Programming+Contest+2007+\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e ACM South American Programming Contest 2007  \u003c/a\u003e \u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":11533,"title":"Max Sum of Max-K-sub-sequence","oj":"HDU","probNum":"3415","num":"V","publicDescId":3161334104978846,"publicDescVersion":1713649507000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"32768 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003dHDOJ+Monthly+Contest+%A8C+2010.06.05\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e HDOJ Monthly Contest – 2010.06.05 \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003eshǎ崽@HDU\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":13096,"title":"Passing the Message","oj":"HDU","probNum":"3410","num":"W","publicDescId":3163520351764830,"publicDescVersion":1713673605000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"32768 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003d2010+National+Programming+Invitational+Contest+Host+by+ZSTU+\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2010 National Programming Invitational Contest Host by ZSTU  \u003c/a\u003e \u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":25789,"title":"Alice\u0027s mooncake shop","oj":"HDU","probNum":"4122","num":"X","publicDescId":3122972046739493,"publicDescVersion":1713632028000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"32768 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003d2011+Asia+Fuzhou+Regional+Contest+\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2011 Asia Fuzhou Regional Contest  \u003c/a\u003e \u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":24533,"title":"Largest Rectangle in a Histogram","oj":"HDU","probNum":"1506","num":"Y","publicDescId":3101491605041836,"publicDescVersion":1713621304000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"32768 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003dUniversity+of+Ulm+Local+Contest+2003\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e University of Ulm Local Contest 2003 \u003c/a\u003e \u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]}],"problemsHash":"05b0773a1cb505e6115131047f6e3812","privatePeerContestIds":[],"enableTimeMachine":true,"sumTime":true,"penalty":1200,"partialScore":false,"customizedWeight":false,"showPeers":false,"clonedFromId":0}

[kuangbin带你飞]专题二十四 二分 尺取 单调栈队列 [Cloned]

[kuangbin带你飞]专题二十四二分尺取单调栈队列 [Cloned]