Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"洛谷-P3379\":[\"最近公共祖先(LCA)\",124438,\"模板\"],\"CodeForces-16E\":[\"Fish\",5090,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/16\\\"\\u003eCodeforces Beta Round 16 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-1704E\":[\"Count Seconds\",2232,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1704\\\"\\u003eCodeTON Round 2 (Div. 1 + Div. 2, Rated, Prizes!)\\u003c/a\\u003e\"],\"CodeForces-1801C\":[\"Music Festival\",3287,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1801\\\"\\u003eCodeforces Round 857 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1025D\":[\"Recovering BST\",3558,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1025\\\"\\u003eCodeforces Round 505 (rated, Div. 1 + Div. 2, based on VK Cup 2018 Final)\\u003c/a\\u003e\"],\"CodeForces-1037E\":[\"Trips\",2800,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1037\\\"\\u003eManthan, Codefest 18 (rated, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1485D\":[\"Multiples and Power Differences\",5093,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1485\\\"\\u003eCodeforces Round 701 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-455A\":[\"Boredom\",58842,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/455\\\"\\u003eCodeforces Round 260 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1110D\":[\"Jongmah\",3603,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1110\\\"\\u003eCodeforces Global Round 1\\u003c/a\\u003e\"],\"CodeForces-1312E\":[\"Array Shrinking\",6013,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1312\\\"\\u003eEducational Codeforces Round 83 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1324F\":[\"Maximum White Subtree\",9406,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1324\\\"\\u003eCodeforces Round 627 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-920E\":[\"Connected Components?\",6210,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/920\\\"\\u003eEducational Codeforces Round 37 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-835F\":[\"Roads in the Kingdom\",1101,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/835\\\"\\u003eCodeforces Round 427 (Div. 2)\\u003c/a\\u003e\"],\"Gym-104901M\":[\"Almost Convex\",372,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/104901\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eThe 2023 ICPC Asia Jinan Regional Contest (The 2nd Universal Cup. Stage 17: Jinan)\\u003c/a\\u003e\"],\"洛谷-P3387\":[\"缩点\",37236,\"模板\"],\"洛谷-P4597\":[\"序列 sequence\",2650,null],\"洛谷-P3541\":[\"Monotonicity\",15,\"POI2010\"],\"洛谷-P1364\":[\"医院设置\",28301,null],\"CodeForces-580D\":[\"Kefa and Dishes\",10466,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/580\\\"\\u003eCodeforces Round 321 (Div. 2)\\u003c/a\\u003e\"],\"POJ-1177\":[\"Picture\",5092,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dIOI+1998\\\"\\u003eIOI 1998\\u003c/a\\u003e\\u003c/div\\u003e\"],\"Gym-104869E\":[\"Sheep Eat Wolves\",487,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/104869\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eThe 2023 ICPC Asia Shenyang Regional Contest (The 2nd Universal Cup. Stage 13: Shenyang)\\u003c/a\\u003e\"],\"CodeForces-1359D\":[\"Yet Another Yet Another Task\",9183,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1359\\\"\\u003eEducational Codeforces Round 88 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1945F\":[\"Kirill and Mushrooms\",3470,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1945\\\"\\u003eCodeforces Round 935 (Div. 3)\\u003c/a\\u003e\"],\"Gym-104857E\":[\"Matrix Distances\",570,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/104857\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eThe 2023 ICPC Asia Hefei Regional Contest (The 2nd Universal Cup. Stage 12: Hefei)\\u003c/a\\u003e\"],\"CodeForces-321E\":[\"Ciel and Gondolas\",5088,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/321\\\"\\u003eCodeforces Round 190 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P3307\":[\"项链\",567,\"SDOI2013\"],\"AtCoder-abc344_f\":[\"Earn to Advance\",530,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc344\\\"\\u003e\\tToyota Programming Contest 2024#3(AtCoder Beginner Contest 344)\\u003c/a\\u003e\"],\"CodeForces-212E\":[\"IT Restaurants\",1826,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/212\\\"\\u003eVK Cup 2012 Finals (unofficial online-version)\\u003c/a\\u003e\"],\"洛谷-P1525\":[\"关押罪犯\",42656,\"NOIP2010 提高组\"],\"OpenJ_Bailian-2746\":[\"约瑟夫问题\",6900,\"\"],\"POJ-1733\":[\"Parity game\",4849,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dCEOI+1999\\\"\\u003eCEOI 1999\\u003c/a\\u003e\\u003c/div\\u003e\"],\"CodeForces-507D\":[\"The Maths Lecture\",1832,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/507\\\"\\u003eCodeforces Round 287 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-628D\":[\"Magic Numbers\",6170,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/628\\\"\\u003eEducational Codeforces Round 8\\u003c/a\\u003e\"],\"CodeForces-713C\":[\"Sonya and Problem Wihtout a Legend\",5208,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/713\\\"\\u003eCodeforces Round 371 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1092F\":[\"Tree with Maximum Cost\",7559,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1092\\\"\\u003eCodeforces Round 527 (Div. 3)\\u003c/a\\u003e\"],\"Gym-102220E\":[\"Minimum Spanning Tree\",440,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/102220\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eThe 13th Chinese Northeast Collegiate Programming Contest\\u003c/a\\u003e\"],\"CodeForces-741D\":[\"Arpa’s letter-marked tree and Mehrdad’s Dokhtar-kosh paths\",2768,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/741\\\"\\u003eCodeforces Round 383 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P8844\":[\"小卡与落叶\",457,\"传智杯 #4 初赛\"],\"Gym-104857G\":[\"Streak Manipulation\",333,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/104857\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eThe 2023 ICPC Asia Hefei Regional Contest (The 2nd Universal Cup. Stage 12: Hefei)\\u003c/a\\u003e\"],\"洛谷-P6268\":[\"舞会\",1802,\"SHOI2002\"],\"Gym-104857J\":[\"Takeout Delivering\",438,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/104857\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eThe 2023 ICPC Asia Hefei Regional Contest (The 2nd Universal Cup. Stage 12: Hefei)\\u003c/a\\u003e\"],\"洛谷-P4767\":[\"邮局\",4333,\"IOI2000\"],\"POJ-2594\":[\"Treasure Exploration\",3644,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2005.08.28\\\"\\u003ePOJ Monthly--2005.08.28\\u003c/a\\u003e,Li Haoyuan\\u003c/div\\u003e\"],\"CodeForces-372C\":[\"Watching Fireworks is Fun\",4226,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/372\\\"\\u003eCodeforces Round 219 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1944E\":[\"Tree Compass\",0,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1944\\\"\\u003eCodeforces Round 934 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-P3834\":[\"可持久化线段树 2\",39812,\"模板\"],\"CodeForces-401D\":[\"Roman and Numbers\",4470,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/401\\\"\\u003eCodeforces Round 235 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1156D\":[\"0-1-Tree\",3963,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1156\\\"\\u003eEducational Codeforces Round 64 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1213F\":[\"Unstable String Sort\",2443,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1213\\\"\\u003eCodeforces Round 582 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1882E1\":[\"Two Permutations (Easy Version)\",952,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1882\\\"\\u003eCodeforces Round 899 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-449D\":[\"Jzzhu and Numbers\",4376,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/449\\\"\\u003eCodeforces Round 257 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1132F\":[\"Clear the String\",7811,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1132\\\"\\u003eEducational Codeforces Round 61 (Rated for Div. 2)\\u003c/a\\u003e\"],\"HDU-2255\":[\"奔小康赚大钱\",4933,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDOJ+2008+Summer+Exercise%A3%A84%A3%A9-+Buffet+Dinner\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDOJ 2008 Summer Exercise(4)- Buffet Dinner \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-939F\":[\"Cutlet\",975,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/939\\\"\\u003eCodeforces Round 464 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-833B\":[\"The Bakery\",4791,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/833\\\"\\u003eCodeforces Round 426 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-788C\":[\"The Great Mixing\",2297,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/788\\\"\\u003eCodeforces Round 407 (Div. 1)\\u003c/a\\u003e\"],\"POJ-1151\":[\"Atlantis\",7176,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dMid-Central+European+Regional+Contest+2000\\\"\\u003eMid-Central European Regional Contest 2000\\u003c/a\\u003e\\u003c/div\\u003e\"],\"QOJ-7175\":[\"Mixed Messages\",488,\"\\u003ca href\\u003d\\\"https://qoj.ac/contest/1356\\\"\\u003eThe 2nd Universal Cup. Stage 2: SPb\\u003c/a\\u003e\\u003cbr\\u003e\\u003ca href\\u003d\\\"https://qoj.ac/contest/1356?v\\u003d1\\\"\\u003eLVII St. Petersburg State University Championship\\u003c/a\\u003e\\u003cbr\\u003e\\u003ca href\\u003d\\\"https://qoj.ac/contest/1356?v\\u003d2\\\"\\u003ePetrozavodsk Summer 2023. Day 4. LVII SPb SU Championship\\u003c/a\\u003e\"],\"CodeForces-1438D\":[\"Powerful Ksenia\",4182,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1438\\\"\\u003eCodeforces Round 682 (Div. 2)\\u003c/a\\u003e\"],\"Gym-103145K\":[\"City\",691,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/103145\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eThe 15th Chinese Northeast Collegiate Programming Contest\\u003c/a\\u003e\"],\"CodeForces-55D\":[\"Beautiful numbers\",6034,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/55\\\"\\u003eCodeforces Beta Round 51\\u003c/a\\u003e\"],\"CodeForces-1777E\":[\"Edge Reverse\",1714,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1777\\\"\\u003eCodeforces Round 845 (Div. 2) and ByteRace 2023\\u003c/a\\u003e\"],\"CodeForces-165E\":[\"Compatible Numbers\",6999,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/165\\\"\\u003eCodeforces Round 112 (Div. 2)\\u003c/a\\u003e\"],\"HDU-3635\":[\"Dragon Balls\",2998,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2010+ACM-ICPC+Multi-University+Training+Contest%A3%A819%A3%A9%A1%AA%A1%AAHost+by+HDU\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 ACM-ICPC Multi-University Training Contest(19)——Host by HDU \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-1943B\":[\"Non-Palindromic Substring\",3142,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1943\\\"\\u003eCodeforces Round 934 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-15D\":[\"Map\",783,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/15\\\"\\u003eCodeforces Beta Round 15\\u003c/a\\u003e\"],\"洛谷-P2634\":[\"聪聪可可\",7784,\"国家集训队\"],\"CodeForces-149D\":[\"Coloring Brackets\",4951,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/149\\\"\\u003eCodeforces Round 106 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1143B\":[\"Nirvana\",10672,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1143\\\"\\u003eCodeforces Round 549 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-189A\":[\"Cut Ribbon\",67725,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/189\\\"\\u003eCodeforces Round 119 (Div. 2)\\u003c/a\\u003e\"],\"LibreOJ-2294\":[\"银河英雄传说\",157,\"NOI2002\"],\"CodeForces-708C\":[\"Centroids\",3172,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/708\\\"\\u003eAIM Tech Round 3 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-914C\":[\"Travelling Salesman and Special Numbers\",3922,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/914\\\"\\u003eCodecraft-18 and Codeforces Round 458 (Div. 1 + Div. 2, combined)\\u003c/a\\u003e\"],\"CodeForces-1304F2\":[\"Animal Observation (hard version)\",1357,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1304\\\"\\u003eCodeforces Round 620 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1454E\":[\"Number of Simple Paths\",5702,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1454\\\"\\u003eCodeforces Round 686 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1466F\":[\"Euclid\\u0027s nightmare\",2810,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1466\\\"\\u003eGood Bye 2020\\u003c/a\\u003e\"],\"CodeForces-1280D\":[\"Miss Punyverse\",968,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1280\\\"\\u003eCodeforces Round 607 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-816E\":[\"Karen and Supermarket\",83,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/816\\\"\\u003eCodeforces Round 419 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-505D\":[\"Mr. Kitayuta\\u0027s Technology\",2602,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/505\\\"\\u003eCodeforces Round 286 (Div. 2)\\u003c/a\\u003e\"],\"HDU-7276\":[\"City Upgrading\",569,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2023%A1%B0%B6%A4%B0%D2%B1%E0%B3%CC%A1%B1%D6%D0%B9%FA%B4%F3%D1%A7%C9%FA%CB%E3%B7%A8%C9%E8%BC%C6%B3%AC%BC%B6%C1%AA%C8%FC%A3%A81%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2023“钉耙编程”中国大学生算法设计超级联赛(1) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-735E\":[\"Ostap and Tree\",892,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/735\\\"\\u003eCodeforces Round 382 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-868F\":[\"Yet Another Minimization Problem\",3768,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/868\\\"\\u003eCodeforces Round 438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined)\\u003c/a\\u003e\"],\"洛谷-P4381\":[\"Island\",3983,\"IOI2008\"],\"黑暗爆炸-1015\":[\"星球大战starwar\",397,\"JSOI2008\"],\"UniversalOJ-284\":[\"快乐游戏鸡\",216,null],\"CodeForces-791D\":[\"Bear and Tree Jumps\",85,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/791\\\"\\u003eCodeforces Round 405 (rated, Div. 2, based on VK Cup 2017 Round 1)\\u003c/a\\u003e\"],\"洛谷-P1399\":[\"快餐店\",2367,\"NOI2013\"],\"CodeForces-1942E\":[\"Farm Game\",1411,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1942\\\"\\u003eCodeTON Round 8 (Div. 1 + Div. 2, Rated, Prizes!)\\u003c/a\\u003e\"],\"CodeForces-1788E\":[\"Sum Over Zero\",2506,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1788\\\"\\u003eCodeforces Round 851 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1942D\":[\"Learning to Paint\",2364,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1942\\\"\\u003eCodeTON Round 8 (Div. 1 + Div. 2, Rated, Prizes!)\\u003c/a\\u003e\"],\"CodeForces-1954E\":[\"Chain Reaction\",1577,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1954\\\"\\u003eEducational Codeforces Round 164 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-245H\":[\"Queries for Number of Palindromes\",6875,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/245\\\"\\u003eCROC-MBTU 2012, Elimination Round (ACM-ICPC)\\u003c/a\\u003e\"],\"OpenJ_Bailian-1182\":[\"食物链\",1404,\"Noi 01\"],\"CodeForces-366C\":[\"Dima and Salad\",5839,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/366\\\"\\u003eCodeforces Round 214 (Div. 2)\\u003c/a\\u003e\"],\"HDU-7326\":[\"String Magic (Easy Version)\",177,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2023%A1%B0%B6%A4%B0%D2%B1%E0%B3%CC%A1%B1%D6%D0%B9%FA%B4%F3%D1%A7%C9%FA%CB%E3%B7%A8%C9%E8%BC%C6%B3%AC%BC%B6%C1%AA%C8%FC%A3%A85%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2023“钉耙编程”中国大学生算法设计超级联赛(5) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-7327\":[\"String Magic (Hard Version)\",104,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2023%A1%B0%B6%A4%B0%D2%B1%E0%B3%CC%A1%B1%D6%D0%B9%FA%B4%F3%D1%A7%C9%FA%CB%E3%B7%A8%C9%E8%BC%C6%B3%AC%BC%B6%C1%AA%C8%FC%A3%A85%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2023“钉耙编程”中国大学生算法设计超级联赛(5) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-7324\":[\"Typhoon\",337,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2023%A1%B0%B6%A4%B0%D2%B1%E0%B3%CC%A1%B1%D6%D0%B9%FA%B4%F3%D1%A7%C9%FA%CB%E3%B7%A8%C9%E8%BC%C6%B3%AC%BC%B6%C1%AA%C8%FC%A3%A85%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2023“钉耙编程”中国大学生算法设计超级联赛(5) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-1061C\":[\"Multiplicity\",9129,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1061\\\"\\u003eCodeforces Round 523 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-P8593\":[\"一个弹的投\",667,\"KDOI-02\"],\"CodeForces-855B\":[\"Marvolo Gaunt\\u0027s Ring\",9314,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/855\\\"\\u003eManthan, Codefest 17\\u003c/a\\u003e\"],\"SGU-495\":[\"Kids and Prizes\",950,null],\"Gym-104270E\":[\"Plants vs. Zombies\",806,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/104270\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eThe 2018 ICPC Asia Qingdao Regional Programming Contest (The 1st Universal Cup, Stage 9: Qingdao)\\u003c/a\\u003e\"],\"CodeForces-1709E\":[\"XOR Tree\",2491,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1709\\\"\\u003eEducational Codeforces Round 132 (Rated for Div. 2)\\u003c/a\\u003e\"],\"SPOJ-FAVDICE\":[\"Favorite Dice\",5944,\"Al-Khawarizm 2006\"],\"HDU-1875\":[\"畅通工程再续\",12120,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2008%D5%E3%B4%F3%D1%D0%BE%BF%C9%FA%B8%B4%CA%D4%C8%C8%C9%ED%C8%FC%A3%A82%A3%A9%A1%AA%A1%AA%C8%AB%D5%E6%C4%A3%C4%E2\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2008浙大研究生复试热身赛(2)——全真模拟 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-P3865\":[\"ST 表\",74646,\"模板\"],\"CodeForces-1941C\":[\"Rudolf and the Ugly String\",29392,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1941\\\"\\u003eCodeforces Round 933 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-13C\":[\"Sequence\",4393,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/13\\\"\\u003eCodeforces Beta Round 13\\u003c/a\\u003e\"],\"POJ-1655\":[\"Balancing Act\",7513,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2004.05.15+IOI+2003+sample+task\\\"\\u003ePOJ Monthly--2004.05.15 IOI 2003 sample task\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3832\":[\"Posters\",160,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNingbo+2009\\\"\\u003eNingbo 2009\\u003c/a\\u003e\\u003c/div\\u003e\"],\"Gym-103446H\":[\"Life is a Game\",617,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/103446\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eThe 2021 ICPC Asia Shanghai Regional Programming Contest\\u003c/a\\u003e\"],\"HDU-7338\":[\"Vector\",99,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2023%A1%B0%B6%A4%B0%D2%B1%E0%B3%CC%A1%B1%D6%D0%B9%FA%B4%F3%D1%A7%C9%FA%CB%E3%B7%A8%C9%E8%BC%C6%B3%AC%BC%B6%C1%AA%C8%FC%A3%A86%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2023“钉耙编程”中国大学生算法设计超级联赛(6) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-7339\":[\"Tree\",198,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2023%A1%B0%B6%A4%B0%D2%B1%E0%B3%CC%A1%B1%D6%D0%B9%FA%B4%F3%D1%A7%C9%FA%CB%E3%B7%A8%C9%E8%BC%C6%B3%AC%BC%B6%C1%AA%C8%FC%A3%A86%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2023“钉耙编程”中国大学生算法设计超级联赛(6) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-204A\":[\"Little Elephant and Interval\",6033,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/204\\\"\\u003eCodeforces Round 129 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1153D\":[\"Serval and Rooted Tree\",5142,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1153\\\"\\u003eCodeforces Round 551 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1941G\":[\"Rudolf and Subway\",2864,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1941\\\"\\u003eCodeforces Round 933 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1400E\":[\"Clear the Multiset\",5394,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1400\\\"\\u003eEducational Codeforces Round 94 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-600E\":[\"Lomsat gelral\",14322,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/600\\\"\\u003eEducational Codeforces Round 2\\u003c/a\\u003e\"],\"CodeForces-797F\":[\"Mice and Holes\",1296,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/797\\\"\\u003eEducational Codeforces Round 19\\u003c/a\\u003e\"],\"CodeForces-191A\":[\"Dynasty Puzzles\",4544,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/191\\\"\\u003eCodeforces Round 121 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P5410\":[\"扩展 KMP/exKMP(Z 函数)\",9231,\"模板\"],\"CodeForces-10D\":[\"LCIS\",4495,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/10\\\"\\u003eCodeforces Beta Round 10\\u003c/a\\u003e\"],\"CodeForces-86D\":[\"Powerful array\",14626,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/86\\\"\\u003eYandex.Algorithm 2011: Round 2\\u003c/a\\u003e\"],\"洛谷-P1972\":[\"HH的项链\",24052,\"SDOI2009\"],\"CodeForces-1407D\":[\"Discrete Centrifugal Jumps\",4756,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1407\\\"\\u003eCodeforces Round 669 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-P1856\":[\"[USACO5.5] 矩形周长Picture\",5055,\"IOI1998\"],\"洛谷-P1613\":[\"跑路\",14410,null],\"洛谷-P2825\":[\"游戏\",2304,\"HEOI2016/TJOI2016\"],\"洛谷-P2704\":[\"炮兵阵地\",20673,\"NOI2001\"],\"CodeForces-118D\":[\"Caesar\\u0027s Legions\",18177,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/118\\\"\\u003eCodeforces Beta Round 89 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-P3919\":[\"可持久化线段树 1(可持久化数组)\",21909,\"模板\"],\"CodeForces-1706D2\":[\"Chopping Carrots (Hard Version)\",1660,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1706\\\"\\u003eCodeforces Round 809 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1140D\":[\"Minimum Triangulation\",13306,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1140\\\"\\u003eEducational Codeforces Round 62 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-865D\":[\"Buy Low Sell High\",5029,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/865\\\"\\u003eMemSQL Start[c]UP 3.0 - Round 2 (onsite finalists)\\u003c/a\\u003e\"],\"CodeForces-1370D\":[\"Odd-Even Subsequence\",9328,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1370\\\"\\u003eCodeforces Round 651 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-922E\":[\"Birds\",2409,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/922\\\"\\u003eCodeforces Round 461 (Div. 2)\\u003c/a\\u003e\"],\"CSG-1126\":[\"Double Shortest Paths\",18,\"\\u003cp\\u003e湖南省第十届大学生计算机程序设计竞赛(HNCPC2014)\\u003c/p\\u003e\"],\"洛谷-P4053\":[\"建筑抢修\",7822,\"JSOI2007\"],\"洛谷-P8773\":[\"选数异或\",2846,\"蓝桥杯 2022 省 A\"],\"洛谷-P4178\":[\"Tree\",9078,null],\"POJ-2289\":[\"Jamie\\u0027s Contact Groups\",2014,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dShanghai+2004\\\"\\u003eShanghai 2004\\u003c/a\\u003e\\u003c/div\\u003e\"],\"CodeForces-11D\":[\"A Simple Task\",5079,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/11\\\"\\u003eCodeforces Beta Round 11\\u003c/a\\u003e\"],\"CodeForces-1923E\":[\"Count Paths\",3154,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1923\\\"\\u003eEducational Codeforces Round 162 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1923D\":[\"Slimes\",5807,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1923\\\"\\u003eEducational Codeforces Round 162 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-266D\":[\"BerDonalds\",770,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/266\\\"\\u003eCodeforces Round 163 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-432D\":[\"Prefixes and Suffixes\",9387,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/432\\\"\\u003eCodeforces Round 246 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1406C\":[\"Link Cut Centroids\",10128,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1406\\\"\\u003eCodeforces Round 670 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-P3806\":[\"点分治 1\",19075,\"模板\"],\"洛谷-P1989\":[\"无向图三元环计数\",3023,null],\"洛谷-P4619\":[\"旧试题\",1087,\"SDOI2018\"],\"HDU-3038\":[\"How Many Answers Are Wrong\",7212,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2009+Multi-University+Training+Contest+13+-+Host+by+HIT\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2009 Multi-University Training Contest 13 - Host by HIT \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-1882C\":[\"Card Game\",11319,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1882\\\"\\u003eCodeforces Round 899 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-607B\":[\"Zuma\",12355,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/607\\\"\\u003eCodeforces Round 336 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1187E\":[\"Tree Painting\",7891,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1187\\\"\\u003eEducational Codeforces Round 67 (Rated for Div. 2)\\u003c/a\\u003e\"],\"洛谷-P1908\":[\"逆序对\",101434,null],\"CodeForces-1951E\":[\"No Palindromes\",2895,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1951\\\"\\u003eCodeforces Global Round 25\\u003c/a\\u003e\"],\"CodeForces-1951D\":[\"Buying Jewels\",4479,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1951\\\"\\u003eCodeforces Global Round 25\\u003c/a\\u003e\"],\"Gym-102391I\":[\"Minimum Diameter Spanning Tree\",159,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/102391\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eXX Open Cup, Grand Prix of Korea\\u003c/a\\u003e\"],\"UniversalOJ-127\":[\"程序自动分析\",1050,\"NOI2015\"],\"HDU-7354\":[\"H. HEX-A-GONE Trails\",194,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2023%A1%B0%B6%A4%B0%D2%B1%E0%B3%CC%A1%B1%D6%D0%B9%FA%B4%F3%D1%A7%C9%FA%CB%E3%B7%A8%C9%E8%BC%C6%B3%AC%BC%B6%C1%AA%C8%FC%A3%A87%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2023“钉耙编程”中国大学生算法设计超级联赛(7) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-888F\":[\"Connecting Vertices\",846,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/888\\\"\\u003eEducational Codeforces Round 32\\u003c/a\\u003e\"],\"Gym-104891A\":[\"(-1,1)-Sumplete\",238,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/104891\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eThe 2023 ICPC Asia Macau Regional Contest (The 2nd Universal Cup. Stage 15: Macau)\\u003c/a\\u003e\"],\"洛谷-P2163\":[\"园丁的烦恼\",4339,\"SHOI2007\"],\"Gym-104891D\":[\"Graph of Maximum Degree 3\",218,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/104891\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eThe 2023 ICPC Asia Macau Regional Contest (The 2nd Universal Cup. Stage 15: Macau)\\u003c/a\\u003e\"],\"CodeForces-985G\":[\"Team Players\",471,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/985\\\"\\u003eEducational Codeforces Round 44 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-2B\":[\"The least round way\",10918,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/2\\\"\\u003eCodeforces Beta Round 2\\u003c/a\\u003e\"]}","joined":false,"groups":{}},"managingGroups":{},"author":"M0Ren","updateTime":1714470046000,"title":"杂题选","dislikeCnt":0,"content":"* [算法基础](#算法基础)\n\t* [枚举](#枚举)\n\t* [构造](#构造)\n* [数据结构](#数据结构)\n* [DP](#dp)\n\t* [线段树优化DP](#线段树优化DP)\n\t* [决策单调性优化DP](#决策单调性优化DP)\n* [图论](#图论)\n* [字符串](#字符串)\n * [KMP](#kmp)\n * [ExKMP](#exkmp)\n* [数学](#数学)\n* [计算几何](#计算几何)\n* [综合](#综合)\n\n# **算法基础**\n\u003cdiv id \u003d 枚举\u003e枚举\u003c/div\u003e\n[problem:Gym-104857E]\n\u003cdiv id \u003d 模拟\u003e模拟\u003c/div\u003e\n[problem:OpenJ_Bailian-2746]\n分治\n[problem:CodeForces-1400E]\n\n贪心\n\n排序\n前后缀和\n[problem:CodeForces-1882C]\n\n差分\n二分、二分答案、三分\n[problem:Gym-104270E]\n[problem:CodeForces-1370D]\n[problem:CodeForces-1923D]\n\n倍增\n\u003cdiv id \u003d 构造\u003e构造\u003c/div\u003e\n[problem:CodeForces-1882E1]\n[problem:CodeForces-1485D]\n[problem:CodeForces-1951D]\n[problem:CodeForces-1438D]\n[problem:Gym-104891A]\n\n# **数据结构**\n并查集\n[problem:UniversalOJ-127] \n[problem:黑暗爆炸-1015] \n[problem:OpenJ_Bailian-1182] \n[problem:LibreOJ-2294] \n\n堆\n[problem:CodeForces-1945F]\n单调队列\n[problem:CodeForces-1941C]\n单调栈\n[problem:CodeForces-1954E]\n\nST表\n[problem:洛谷-P3865]\n[problem:HDU-7354]\n简单莫队\n[problem:CodeForces-86D]\n树状数组\n线段树\n可持久化线段树(主席树)\n[problem:洛谷-P3919]\n[problem:洛谷-P3834]\n\n***\n# **DP**\n反悔贪心\n[problem:CodeForces-865D]\n[problem:洛谷-P4053]\n[problem:CodeForces-13C]\n[problem:洛谷-P4597]\n[problem:CodeForces-713C]\n\n线性dp\n[problem:CodeForces-1359D]\n[problem:CodeForces-2B]\n[problem:QOJ-7175]\n[problem:CodeForces-1061C]\n[problem:CodeForces-191A]\n[problem:CodeForces-455A]\n[problem:CodeForces-1110D]\n[problem:CodeForces-245H]\n[problem:AtCoder-abc344_f]\n[problem:Gym-104857G] \n[problem:CodeForces-10D]\n\n概率dp\n[problem:SPOJ-FAVDICE]\n[problem:SGU-495]\n\n\n背包问题\n[problem:CodeForces-189A]\n[problem:CodeForces-855B]\n[problem:CodeForces-118D]\n[problem:CodeForces-366C]\n[problem:CodeForces-788C]\n[problem:CodeForces-922E]\n\n区间DP\n[problem:CodeForces-607B]\n[problem:CodeForces-149D]\n[problem:CodeForces-1025D]\n[problem:CodeForces-1140D]\n[problem:CodeForces-1312E]\n[problem:CodeForces-888F]\n[problem:CodeForces-1132F]\n\n状压DP\n[problem:CodeForces-580D]\n[problem:CodeForces-11D]\n[problem:CodeForces-16E]\n[problem:CodeForces-401D]\n[problem:洛谷-P2704]\n\n高维前缀和(SOS DP)\n[problem:CodeForces-165E]\n[problem:CodeForces-449D]\n\n数位DP\n[problem:CodeForces-1143B]\n[problem:CodeForces-204A]\n[problem:CodeForces-55D]\n[problem:CodeForces-628D]\n[problem:CodeForces-914C]\n[problem:CodeForces-507D]\n\n树形DP\n[problem:HDU-7276]\n[problem:CodeForces-1153D]\n[problem:CodeForces-735E]\n[problem:CodeForces-791D]\n\n树上背包\n[problem:CodeForces-1280D]\n[problem:CodeForces-212E]\n[problem:CodeForces-816E]\n\n换根DP\n[problem:CodeForces-1187E]\n[problem:CodeForces-708C]\n[problem:CodeForces-1156D]\n[problem:CodeForces-1092F]\n[problem:CodeForces-1187E]\n[problem:CodeForces-1324F]\n\n优先队列优化DP\n[problem:Gym-104869E]\n[problem:CodeForces-1942D]\n\n 单调队列优化DP\n[problem:CodeForces-372C]\n[problem:CodeForces-1304F2]\n[problem:CodeForces-797F]\n[problem:CodeForces-939F]\n[problem:CodeForces-15D]\n单调栈优化DP\n[problem:CodeForces-1407D]\n\u003cdiv id \u003d 线段树优化DP\u003e线段树优化DP\u003c/div\u003e\n[problem:CodeForces-1801C]\n[problem:CodeForces-1788E]\n\n\u003cdiv id \u003d 决策单调性优化DP\u003e决策单调性优化DP\u003c/div\u003e\n[problem:洛谷-P4767]\n[problem:CodeForces-321E]\n[problem:CodeForces-833B]\n[problem:CodeForces-868F]\n\n***\n# **图论**\n未分类\n[problem:CodeForces-1466F]\n[problem:CodeForces-1213F]\n[problem:CodeForces-920E]\n[problem:Gym-102391I]\n[problem:POJ-1655]\n[problem:洛谷-P1364]\n[problem:CodeForces-1406C]\n[problem:HDU-3038]\n[problem:POJ-1733]\n[problem:HDU-3635]\n[problem:洛谷-P1525]\n[problem:HDU-1875]\n[problem:Gym-103145K]\n[problem:Gym-103446H]\n[problem:CodeForces-1706D2]\n[problem:POJ-2594]\n[problem:洛谷-P6268]\n[problem:洛谷-P2825]\n[problem:POJ-2289]\n[problem:HDU-2255]\n图的绝对中心\n[problem:CodeForces-266D]\n\n三元环、四元环计数\n[problem:洛谷-P1989]\n[problem:CodeForces-985G]\n[problem:洛谷-P3541]\n[problem:洛谷-P4619]\n\n搜索\n[problem:CodeForces-1941G]\n[problem:Gym-104857J]\n\n最短路\n[problem:洛谷-P1613]\n\n拓扑排序\n[problem:CodeForces-1037E]\n[problem:CodeForces-1704E]\n\n连通分量\n[problem:洛谷-P3387]\n[problem:CodeForces-505D]\n[problem:CodeForces-1777E]\n[problem:Gym-102220E]\n\n最近公共祖先\n[problem:洛谷-P3379]\n\n最小费用最大流\n[problem:CSG-1126]\n\n树的直径\n[problem:CodeForces-1944E]\n\n树上差分\n\n树上启发式合并\n[problem:CodeForces-600E]\n[problem:CodeForces-741D]\n[problem:UniversalOJ-284]\n[problem:CodeForces-1709E]\n[problem:CodeForces-1923E]\n\n树上点分治\n[problem:洛谷-P3806]\n[problem:HDU-7339]\n[problem:洛谷-P4178]\n[problem:洛谷-P2634]\n\n\n基环树(环套树)\n[problem:CodeForces-835F]\n[problem:洛谷-P1399]\n[problem:洛谷-P4381]\n[problem:CodeForces-1454E]\n\n\n***\n# **字符串**\n\u003cdiv id \u003d kmp\u003eKMP\u003c/div\u003e\n[problem:CodeForces-432D]\n\n\u003cdiv id \u003d exkmp\u003eExKMP(Z函数)\u003c/div\u003e\n[problem:洛谷-P5410]\n字符串hash\n[problem:洛谷-P3307]\n[problem:CodeForces-1951E]\n马拉车\n[problem:HDU-7326]\n[problem:CodeForces-1943B]\n\n回文自动机\n[problem:HDU-7327]\n***\n# **数学**\n组合数\n[problem:CodeForces-1942E]\n\n高斯消元法\n[problem:HDU-7338]\n# **计算几何**\n[problem:HDU-7324]\n扫描线\n[problem:POJ-1151]\n[problem:POJ-1177]\n[problem:POJ-3832]\n[problem:洛谷-P1856]\n[problem:洛谷-P2163]\n[problem:洛谷-P1908]\n[problem:洛谷-P1972]\n[problem:洛谷-P8593]\n[problem:洛谷-P8773]\n[problem:洛谷-P8844]\n\n二维凸包\n[problem:Gym-104901M]\n\n三维凸包\n***\n\n# **综合**\n简单\n[problem:Gym-104891D]\n\n\n","threadId":152494,"likeCnt":1,"createTime":1690537843000,"isWorkbook":true,"viewCnt":738,"openness":2,"fav":false,"id":3900,"trustable":false}