Luogu 🟢 P1950 长方形
逐列轉成柱狀圖後,每列答案就是區間最小值總和;可用單調棧邊界計數或單調棧優化 DP 線性求解。
Luogu 🟢 P2627 [USACO11OPEN] Mowing the Lawn G
發表於|Luogu🟢 (普及+/提高)
Problem solving record for Luogu P2627 [USACO11OPEN] Mowing the Lawn G.
最新文章
標籤
AlgoCodeforcesPythonLuogu動態規劃(Dynamic Programming)單調佇列(Monotone Queue)單調佇列優化DP併查集(Disjoint Set Union)帶權並查集(Weighted DSU)數學(Math)圖論(Graph Theory)雜湊(Hashing)隨機化(Randomized)基環樹(Pseudotree)和雜湊AtCoderAtCoder Beginner ContestABC模擬(Simulation)狀態壓縮計數(Counter)前綴和(Prefix Sum)貢獻法縮點有序容器(Sorted Container)C++模運算(Modular Arithmetic)雜湊表(Hash Table)回溯(Backtracking)DFS
網站資訊
文章數量 :
364
總字數 :
524.8k
最後更新時間 :


![Luogu 🟣 P3631 [APIO2011] 方格染色](https://i.gdst.dev/cover/P3631.webp)
![Luogu 🟣 P8819 [CSP-S 2022] 星战](https://i.gdst.dev/cover/P8819.webp)
![Luogu 🟢 P2627 [USACO11OPEN] Mowing the Lawn G](https://i.gdst.dev/works/846172612737479668.webp)





