{"workbook":{"problemsBrief":"{\"洛谷-P3512\":[\"PIL-Pilots\",3789,\"POI 2010\"],\"洛谷-P5788\":[\"单调栈\",71765,\"模板\"],\"洛谷-P3400\":[\"仓鼠窝\",1795,null],\"洛谷-P2698\":[\"Flowerpot S\",8827,\"USACO12MAR\"],\"洛谷-P3467\":[\"PLA-Postering\",8653,\"POI 2008\"],\"洛谷-P2866\":[\"Bad Hair Day S\",25530,\"USACO06NOV\"],\"洛谷-P3957\":[\"跳房子\",23099,\"NOIP 2017 普及组\"],\"洛谷-P1886\":[\"单调队列 / 滑动窗口\",118722,\"模板\"],\"洛谷-P1823\":[\"Patrik 音乐会的等待\",11651,\"COI 2007\"],\"SPOJ-HISTOGRA\":[\"Largest Rectangle in a Histogram\",10493,\"University of Ulm Local Contest 2003\"],\"洛谷-P1725\":[\"琪露诺\",28178,null],\"CodeForces-1313C2\":[\"Skyscrapers (hard version)\",7542,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1313\\\"\\u003eCodeforces Round 622 (Div. 2)\\u003c/a\\u003e\"],\"LibreOJ-10180\":[\"烽火传递\",1995,\"一本通 5.5 练习 1\"],\"AtCoder-dp_b\":[\"Frog 2\",11367,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/dp\\\"\\u003eEducational DP Contest\\u003c/a\\u003e\"],\"洛谷-P4147\":[\"玉蟾宫\",19013,null]}","joined":false,"groups":{}},"managingGroups":{},"collectingGroups":[],"author":"xboHodx","updateTime":1737031735000,"title":"单调栈和单调队列","dislikeCnt":0,"content":"单调栈\n[problem:洛谷-P5788]\n[problem:洛谷-P2866]\n[problem:SPOJ-HISTOGRA] 洛谷SP1805\n[problem:洛谷-P3467]\n[problem:洛谷-P1823]\n[problem:洛谷-P4147]二维数据，在一维上用单调栈\n[problem:洛谷-P3400]\n[problem:CodeForces-1313C2]\n单调队列\n[problem:洛谷-P1886]\n[problem:洛谷-P1725]\n[problem:洛谷-P3957]上一题加二分\n[problem:洛谷-P3512]\n[problem:洛谷-P2698]\n[problem:LibreOJ-10180]\n[problem:AtCoder-dp_b]","threadId":210126,"likeCnt":0,"createTime":1734781259000,"isWorkbook":true,"viewCnt":586,"openness":2,"fav":false,"id":6986,"trustable":false}
