Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"洛谷-P2444\":[\"病毒\",5781,\"POI2000\"],\"LibreOJ-3676\":[\"小明的树\",204,\"北大集训 2021\"],\"洛谷-P5838\":[\"Milk Visits G\",1598,\"USACO19DEC\"],\"LibreOJ-6029\":[\"市场\",1232,\"雅礼集训 2017 Day1\"],\"LibreOJ-3673\":[\"简单数据结构\",65,\"北大集训 2021\"],\"洛谷-P1912\":[\"诗人小G\",3759,\"NOI2009\"],\"LibreOJ-6144\":[\"C\",104,\"2017 山东三轮集训 Day6\"],\"CodeForces-715B\":[\"Complete The Graph\",2983,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/715\\\"\\u003eCodeforces Round 372 (Div. 1)\\u003c/a\\u003e\"],\"HDU-6315\":[\"Naive Operations\",1771,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2018+Multi-University+Training+Contest+2\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2018 Multi-University Training Contest 2 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UniversalOJ-218\":[\"火车管理\",518,\"UNR #1\"],\"CodeForces-702F\":[\"T-Shirts\",1301,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/702\\\"\\u003eEducational Codeforces Round 15\\u003c/a\\u003e\"],\"黑暗爆炸-3306\":[\"树\",112,\"\"],\"CodeForces-1093F\":[\"Vasya and Array\",1000,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1093\\\"\\u003eEducational Codeforces Round 56 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-467D\":[\"Fedor and Essay\",1943,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/467\\\"\\u003eCodeforces Round 267 (Div. 2)\\u003c/a\\u003e\"],\"AtCoder-agc049_a\":[\"Erasing Vertices\",453,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/agc049\\\"\\u003eAtCoder Grand Contest 049\\u003c/a\\u003e\"],\"洛谷-P4198\":[\"楼房重建\",6813,null],\"AtCoder-agc026_d\":[\"Histogram Coloring\",188,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/agc026\\\"\\u003eAtCoder Grand Contest 026\\u003c/a\\u003e\"],\"洛谷-P4630\":[\"铁人两项\",3071,\"APIO2018\"],\"CodeForces-1416D\":[\"Graph and Queries\",1896,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1416\\\"\\u003eCodeforces Round 673 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P4513\":[\"小白逛公园\",11264,null],\"洛谷-P3302\":[\"森林\",3481,\"SDOI2013\"],\"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\"],\"LibreOJ-6039\":[\"珠宝 /「NAIPC2016」Jewel Thief\",919,\"雅礼集训 2017 Day5\"],\"洛谷-P3426\":[\"SZA-Template\",2862,\"POI2005\"],\"LibreOJ-6038\":[\"远行\",467,\"雅礼集训 2017 Day5\"],\"LibreOJ-6276\":[\"果树\",166,null],\"洛谷-P5608\":[\"文化课\",255,\"Ynoi2013\"],\"HDU-5118\":[\"GRE Words Once More!\",127,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2014ACM%2FICPC%D1%C7%D6%DE%C7%F8%B1%B1%BE%A9%D5%BE-%D6%D8%CF%D6%C8%FC%A3%A8%B8%D0%D0%BB%B1%B1%CA%A6%BA%CD%C9%CF%BD%BB%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2014ACM/ICPC亚洲区北京站-重现赛(感谢北师和上交) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UniversalOJ-228\":[\"基础数据结构练习题\",1567,null],\"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-587D\":[\"Duff in Mafia\",725,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/587\\\"\\u003eCodeforces Round 326 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P7114\":[\"字符串匹配\",5719,\"NOIP2020\"],\"CodeForces-696E\":[\"...Wait for it...\",537,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/696\\\"\\u003eCodeforces Round 362 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P10141\":[\"Merging Cells P\",118,\"USACO24JAN\"],\"洛谷-P5610\":[\"大学\",1051,\"Ynoi2013\"],\"CodeForces-280D\":[\"k-Maximum Subsequence Sum\",1264,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/280\\\"\\u003eCodeforces Round 172 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P3435\":[\"OKR-Periods of Words\",7880,\"POI2006\"],\"洛谷-P7914\":[\"括号序列\",6080,\"CSP-S 2021\"],\"CodeForces-1778D\":[\"Flexible String Revisit\",2612,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1778\\\"\\u003eCodeforces Round 848 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-453E\":[\"Little Pony and Lord Tirek\",710,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/453\\\"\\u003eCodeforces Round 259 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-T367829\":[\"软萌甜心小仙女\",43,null],\"CodeForces-1548C\":[\"The Three Little Pigs\",1756,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1548\\\"\\u003eCodeforces Round 736 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1580D\":[\"Subsequence\",785,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1580\\\"\\u003eCodeforces Round 745 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P6272\":[\"没有人的算术\",209,\"湖北省队互测2014\"],\"洛谷-P5066\":[\"人人本着正义之名\",327,\"Ynoi2014\"],\"洛谷-P6033\":[\"合并果子 加强版\",7964,\"NOIP2004 提高组\"],\"洛谷-P4097\":[\"李超线段树 / [HEOI2013] Segment\",6925,\"模板\"],\"洛谷-P5069\":[\"纵使日薄西山\",577,\"Ynoi2015\"],\"洛谷-P5068\":[\"我回来了\",880,\"Ynoi2015\"],\"洛谷-P3567\":[\"KUR-Couriers\",5370,\"POI2014\"],\"洛谷-P4899\":[\"werewolf 狼人\",1568,\"IOI2018\"],\"CodeForces-1903F\":[\"Babysitting\",562,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1903\\\"\\u003eCodeforces Round 912 (Div. 2)\\u003c/a\\u003e\"],\"LibreOJ-6498\":[\"农民\",217,\"雅礼集训 2018 Day2\"],\"洛谷-T372191\":[\"小猫吃火龙果\",13,null],\"CodeForces-1874D\":[\"Jellyfish and Miku\",665,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1874\\\"\\u003eCodeforces Round 901 (Div. 1)\\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\"],\"洛谷-P5073\":[\"世上最幸福的女孩\",304,\"Ynoi2015\"],\"CodeForces-464E\":[\"The Classic Problem\",1470,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/464\\\"\\u003eCodeforces Round 265 (Div. 1)\\u003c/a\\u003e\"],\"黑暗爆炸-3551\":[\"Peaks加强版\",340,\"ONTAK2010\"],\"洛谷-P5631\":[\"最小mex生成树\",729,null],\"CodeForces-1603E\":[\"A Perfect Problem\",450,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1603\\\"\\u003eCodeforces Round 752 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P3215\":[\"括号修复 / [JSOI2011]括号序列\",1193,\"HNOI2011\"],\"UVA-1108\":[\"Mining Your Own Business\",1328,null],\"洛谷-P5633\":[\"最小度限制生成树\",1595,null],\"HDU-5709\":[\"Claris Loves Painting\",190,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%26quot%3B%B0%CD%BF%A8%CB%B9%B1%AD%26quot%3B+%D6%D0%B9%FA%B4%F3%D1%A7%C9%FA%B3%CC%D0%F2%C9%E8%BC%C6%BE%BA%C8%FC+-+%C5%AE%C9%FA%D7%A8%B3%A1\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e \\\"巴卡斯杯\\\" 中国大学生程序设计竞赛 - 女生专场 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-P2922\":[\"Secret Message G\",6650,\"USACO08DEC\"],\"CodeForces-1017G\":[\"The Tree\",863,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1017\\\"\\u003eCodeforces Round 502 (in memory of Leopoldo Taravilse, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1344E\":[\"Train Tracks\",279,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1344\\\"\\u003eCodeforces Round 639 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1930E\":[\"2..3...4.... Wonderful! Wonderful!\",976,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1930\\\"\\u003ethink-cell Round 1\\u003c/a\\u003e\"],\"CodeForces-786B\":[\"Legacy\",5892,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/786\\\"\\u003eCodeforces Round 406 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P2371\":[\"墨墨的等式\",4157,\"国家集训队\"],\"洛谷-P3586\":[\"LOG\",2935,\"POI2015\"],\"洛谷-P4551\":[\"最长异或路径\",12186,null],\"洛谷-P2375\":[\"动物园\",11059,\"NOI2014\"],\"洛谷-P7706\":[\"文文的摄影布置\",1111,\"Wdsr-2.7\"],\"AtCoder-agc050_d\":[\"Shopping\",129,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/agc050\\\"\\u003eAtCoder Grand Contest 050 (Good Bye rng_58 Day 1)\\u003c/a\\u003e\"],\"洛谷-P3225\":[\"矿场搭建\",7557,\"HNOI2012\"],\"洛谷-P1600\":[\"天天爱跑步\",10945,\"NOIP2016 提高组\"],\"洛谷-P6617\":[\"查找 Search\",736,null],\"LibreOJ-3080\":[\"国际象棋\",284,\"2019 集训队互测 Day 5\"],\"CodeForces-1060F\":[\"Shrinking Tree\",561,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1060\\\"\\u003eCodeforces Round 513 by Barcelona Bootcamp (rated, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-543E\":[\"Listening to Music\",295,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/543\\\"\\u003eCodeforces Round 302 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P7831\":[\"Travelling Merchant\",629,\"CCO2021\"],\"洛谷-P4322\":[\"最佳团体\",3383,\"JSOI2016\"],\"洛谷-P6864\":[\"记忆\",292,\"RC-03\"],\"洛谷-P2023\":[\"维护序列\",16583,\"AHOI2009\"],\"Gym-104065B\":[\"Call Me Call Me\",29,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/104065\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2022 China Collegiate Programming Contest (CCPC) Mianyang Onsite\\u003c/a\\u003e\"],\"AtCoder-arc132_e\":[\"Paw\",139,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc132\\\"\\u003eAtCoder Regular Contest 132\\u003c/a\\u003e\"],\"洛谷-P2149\":[\"Elaxia的路线\",3822,\"SDOI2009\"],\"HDU-6378\":[\"度度熊玩数组\",55,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2018+%A1%B0%B0%D9%B6%C8%D6%AE%D0%C7%A1%B1%B3%CC%D0%F2%C9%E8%BC%C6%B4%F3%C8%FC+-+%B3%F5%C8%FC%A3%A8A%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2018 “百度之星”程序设计大赛 - 初赛(A) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-1584D\":[\"Guess the Permutation\",3547,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1584\\\"\\u003eTechnocup 2022 - Elimination Round 2\\u003c/a\\u003e\"],\"HDU-6013\":[\"Lotus and Thermodynamics\",0,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dBestCoder+Round+%2391\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e BestCoder Round #91 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-P2827\":[\"蚯蚓\",15648,\"NOIP2016 提高组\"],\"洛谷-P3919\":[\"可持久化线段树 1(可持久化数组)\",21909,\"模板\"],\"洛谷-P6071\":[\"Treequery\",495,\"MdOI R1\"],\"洛谷-P6072\":[\"Path\",474,\"MdOI R1\"],\"洛谷-P2391\":[\"白雪皑皑\",3737,null],\"AtCoder-arc160_d\":[\"Mahjong\",143,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc160\\\"\\u003eAtCoder Regular Contest 160\\u003c/a\\u003e\"],\"洛谷-P8496\":[\"众数\",1393,\"NOI2022\"],\"AtCoder-agc002_f\":[\"Leftmost Ball\",234,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/agc002\\\"\\u003eAtCoder Grand Contest 002\\u003c/a\\u003e\"],\"洛谷-P5664\":[\"Emiya 家今天的饭\",8646,\"CSP-S2019\"],\"洛谷-P4211\":[\"LCA\",5067,\"LNOI2014\"],\"洛谷-P4216\":[\"情报传递\",1869,\"SCOI2015\"],\"洛谷-P3128\":[\"Max Flow P\",15269,\"USACO15DEC\"],\"洛谷-P5305\":[\"旧词\",1524,\"GXOI/GZOI2019\"],\"洛谷-P5304\":[\"旅行者\",3507,\"GXOI/GZOI2019\"],\"洛谷-P4219\":[\"大融合\",4287,\"BJOI2014\"],\"CodeForces-444C\":[\"DZY Loves Colors\",3070,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/444\\\"\\u003eCodeforces Round 254 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P2839\":[\"middle\",3384,\"国家集训队\"],\"SPOJ-BUSINESS\":[\"Mining your own business\",528,\"ICPC WF 2011\"],\"CodeForces-1842G\":[\"Tenzing and Random Operations\",1014,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1842\\\"\\u003eCodeTON Round 5 (Div. 1 + Div. 2, Rated, Prizes!)\\u003c/a\\u003e\"],\"CodeForces-1111E\":[\"Tree\",903,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1111\\\"\\u003eCodeCraft-19 and Codeforces Round 537 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-P2042\":[\"维护数列\",8734,\"NOI2005\"],\"洛谷-P1197\":[\"星球大战\",17708,\"JSOI2008\"],\"洛谷-P4344\":[\"脑洞治疗仪\",2292,\"SHOI2015\"],\"AtCoder-agc013_e\":[\"Placing Squares\",148,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/agc013\\\"\\u003eAtCoder Grand Contest 013\\u003c/a\\u003e\"],\"洛谷-P4587\":[\"神秘数\",2608,\"FJOI2016\"],\"洛谷-P5795\":[\"异或运算\",719,\"THUSC2015\"],\"AtCoder-arc156_d\":[\"Xor Sum 5\",153,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc156\\\"\\u003eAtCoder Regular Contest 156\\u003c/a\\u003e\"],\"AtCoder-arc154_e\":[\"Reverse and Inversion\",121,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc154\\\"\\u003eAtCoder Regular Contest 154\\u003c/a\\u003e\"],\"洛谷-P7739\":[\"密码箱\",755,\"NOI2021\"],\"洛谷-P5314\":[\"ODT\",330,\"Ynoi2011\"],\"LibreOJ-3276\":[\"遗迹\",326,\"JOISC 2020 Day2\"],\"CodeForces-1530F\":[\"Bingo\",774,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1530\\\"\\u003eCodeforces Round 733 (Div. 1 + Div. 2, based on VK Cup 2021 - Elimination (Engine))\\u003c/a\\u003e\"],\"LibreOJ-3273\":[\"扫除\",306,\"JOISC 2020 Day1\"],\"CodeForces-917D\":[\"Stranger Trees\",1115,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/917\\\"\\u003eCodeforces Round 459 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1554E\":[\"You\",1196,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1554\\\"\\u003eCodeforces Round 735 (Div. 2)\\u003c/a\\u003e\"],\"AtCoder-arc068_d\":[\"Solitaire\",66,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc068\\\"\\u003eAtCoder Regular Contest 068\\u003c/a\\u003e\"],\"CodeForces-536E\":[\"Tavas on the Path\",385,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/536\\\"\\u003eCodeforces Round 299 (Div. 1)\\u003c/a\\u003e\"],\"LibreOJ-504\":[\"ZQC 的手办\",429,\"LibreOJ β Round\"],\"洛谷-P8392\":[\"Uplifting Excursion\",160,\"BalticOI 2022 Day1\"],\"洛谷-P4592\":[\"异或\",1979,\"TJOI2018\"],\"洛谷-P4234\":[\"最小差值生成树\",1774,null],\"51Nod-1766\":[\"树上的最远点对\",290,\"xfause\"],\"CodeForces-960H\":[\"Santa\\u0027s Gift\",269,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/960\\\"\\u003eDivide by Zero 2018 and Codeforces Round 474 (Div. 1 + Div. 2, combined)\\u003c/a\\u003e\"],\"AtCoder-abc299_h\":[\"Dice Sum Infinity\",29,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc299\\\"\\u003eTokio Marine \\u0026amp; Nichido Fire Insurance Programming Contest 2023(AtCoder Beginner Contest 299)\\u003c/a\\u003e\"],\"洛谷-P5446\":[\"绿绿和串串\",1864,\"THUPC2018\"],\"洛谷-P7624\":[\"地铁\",241,\"AHOI2021初中组\"],\"洛谷-P5329\":[\"字符串\",1355,\"SNOI2019\"],\"TopCoder-7295\":[\"ThreeBuses\",12,\"\\u003ca href\\u003d\\\"https://community.topcoder.com/tc?module\\u003dProblemDetail\\u0026amp;rd\\u003d10657\\u0026amp;pm\\u003d7295\\\"\\u003eSingle Round Match 333 Round 1 - Division I, Level Three\\u003c/a\\u003e\"],\"CodeForces-438D\":[\"The Child and Sequence\",9316,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/438\\\"\\u003eCodeforces Round 250 (Div. 1)\\u003c/a\\u003e\"],\"TopCoder-11608\":[\"AxonometricProjection\",22,\"\\u003ca href\\u003d\\\"https://community.topcoder.com/tc?module\\u003dProblemDetail\\u0026amp;rd\\u003d14549\\u0026amp;pm\\u003d11608\\\"\\u003eSingle Round Match 524 Round 1 - Division I, Level Three\\u003c/a\\u003e\"],\"HDU-5634\":[\"Rikka with Phi\",459,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dBestCoder+Round+%2373+%28div.1%29\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e BestCoder Round #73 (div.1) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-5997\":[\"rausen loves cakes\",237,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dBestCoder+Round+%2390\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e BestCoder Round #90 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-7138\":[\"String\",261,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2022%A1%B0%BA%BC%B5%E7%B1%AD%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 2022“杭电杯”中国大学生算法设计超级联赛(1) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"AtCoder-abc242_h\":[\"Random Painting\",59,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc242\\\"\\u003eAtCoder Beginner Contest 242\\u003c/a\\u003e\"],\"洛谷-P3398\":[\"仓鼠找 sugar\",9734,null],\"洛谷-P2860\":[\"Redundant Paths G\",5981,\"USACO06JAN\"],\"洛谷-P3275\":[\"糖果\",10677,\"SCOI2011\"],\"洛谷-P4001\":[\"狼抓兔子\",6530,\"ICPC-Beijing 2006\"],\"CodeForces-482E\":[\"ELCA\",203,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/482\\\"\\u003eCodeforces Round 275 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P7519\":[\"滚榜\",1548,\"省选联考 2021 A/B 卷\"],\"洛谷-P7516\":[\"图函数\",1636,\"省选联考 2021 A/B 卷\"],\"CodeForces-1605D\":[\"Treelabeling\",2908,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1605\\\"\\u003eCodeforces Round 754 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-P3834\":[\"可持久化线段树 2\",39812,\"模板\"],\"CodeForces-1552F\":[\"Telepanting\",2820,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1552\\\"\\u003eCodeforces Global Round 15\\u003c/a\\u003e\"],\"CodeForces-1782F\":[\"Bracket Insertion\",3,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1782\\\"\\u003eCodeforces Round 844 (Div. 1 + Div. 2, based on VK Cup 2022 - Elimination Round)\\u003c/a\\u003e\"],\"CodeForces-1552E\":[\"Colors and Intervals\",1778,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1552\\\"\\u003eCodeforces Global Round 15\\u003c/a\\u003e\"],\"CodeForces-679E\":[\"Bear and Bad Powers of 42\",759,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/679\\\"\\u003eCodeforces Round 356 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P3041\":[\"Video Game G\",2442,\"USACO12JAN\"],\"洛谷-P7880\":[\"rldcot\",407,\"Ynoi2006\"],\"AtCoder-agc023_e\":[\"Inversions\",63,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/agc023\\\"\\u003eAtCoder Grand Contest 023\\u003c/a\\u003e\"],\"CodeForces-383C\":[\"Propagating tree\",6731,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/383\\\"\\u003eCodeforces Round 225 (Div. 1)\\u003c/a\\u003e\"],\"LibreOJ-6777\":[\"大毒瘤\",59,\"2021 营员交流\"],\"洛谷-P2757\":[\"等差子序列\",2460,\"国家集训队\"],\"Gym-104095D\":[\"园艺大师\",24,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/104095\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2020 CCPC Henan Provincial Collegiate Programming Contest\\u003c/a\\u003e\"],\"黑暗爆炸-3159\":[\"决战\",60,\"Katharon+#1\"],\"洛谷-P6563\":[\"一直在你身旁\",684,\"SBCOI2020\"],\"洛谷-P3293\":[\"美味\",3049,\"SCOI2016\"],\"洛谷-P4141\":[\"消失之物\",4891,null],\"洛谷-P5357\":[\"AC 自动机\",13472,\"模板\"],\"TopCoder-14102\":[\"DiameterOfRandomTree\",2,\"\\u003ca href\\u003d\\\"https://community.topcoder.com/tc?module\\u003dProblemDetail\\u0026amp;rd\\u003d16627\\u0026amp;pm\\u003d14102\\\"\\u003eSingle Round Match 677 Round 1 - Division I, Level Two\\u003c/a\\u003e\"],\"洛谷-P4145\":[\"上帝造题的七分钟 2 / 花神游历各国\",16185,null],\"洛谷-P5354\":[\"由乃的 OJ\",1236,\"Ynoi2017\"],\"洛谷-P6327\":[\"区间加区间 sin 和\",3586,null],\"TopCoder-17483\":[\"SpaceMission\",25,\"\\u003ca href\\u003d\\\"https://community.topcoder.com/tc?module\\u003dProblemDetail\\u0026amp;rd\\u003d19128\\u0026amp;pm\\u003d17483\\\"\\u003eSingle Round Match 826 Round 1 - Division I, Level Three\\u003c/a\\u003e\"],\"AtCoder-abc270_h\":[\"add 1 \",37,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc270\\\"\\u003eTOYOTA MOTOR CORPORATION Programming Contest 2022(AtCoder Beginner Contest 270)\\u003c/a\\u003e\"],\"Gym-103447L\":[\"Karshilov\\u0027s Matching Problem\",47,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/103447\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eThe 2021 China Collegiate Programming Contest (Harbin)\\u003c/a\\u003e\"],\"HDU-4336\":[\"Card Collector\",3040,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2012+Multi-University+Training+Contest+4\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2012 Multi-University Training Contest 4 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"AtCoder-agc005_d\":[\"~K Perm Counting\",201,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/agc005\\\"\\u003eAtCoder Grand Contest 005\\u003c/a\\u003e\"],\"AtCoder-abc217_h\":[\"Snuketoon\",73,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc217\\\"\\u003eAtCoder Beginner Contest 217\\u003c/a\\u003e\"],\"CodeForces-1372E\":[\"Omkar and Last Floor\",1034,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1372\\\"\\u003eCodeforces Round 655 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-487E\":[\"Tourists\",2333,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/487\\\"\\u003eCodeforces Round 278 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P5482\":[\"不等式组\",1515,\"JLOI2011\"],\"洛谷-P4036\":[\"火星人\",2212,\"JSOI2008\"],\"洛谷-P6698\":[\"病毒\",46,\"BalticOI 2020 Day2\"],\"CodeForces-1327E\":[\"Count The Blocks\",8753,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1327\\\"\\u003eEducational Codeforces Round 84 (Rated for Div. 2)\\u003c/a\\u003e\"],\"黑暗爆炸-4380\":[\"Myjnie\",85,\"POI2015\"],\"洛谷-P6216\":[\"回文匹配\",1438,null],\"洛谷-P3747\":[\"相逢是问候\",2037,\"六省联考 2017\"],\"洛谷-P2414\":[\"阿狸的打字机\",5002,\"NOI2011\"],\"洛谷-P3627\":[\"抢掠计划\",7040,\"APIO2009\"],\"洛谷-T11738\":[\"伪神\",33,null],\"AtCoder-abc134_f\":[\"Permutation Oddness\",97,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc134\\\"\\u003eAtCoder Beginner Contest 134\\u003c/a\\u003e\"],\"CodeForces-1286E\":[\"Fedya the Potter Strikes Back\",544,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1286\\\"\\u003eCodeforces Round 612 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1654F\":[\"Minimal String Xoration\",1161,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1654\\\"\\u003eCodeforces Round 778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round)\\u003c/a\\u003e\"],\"洛谷-P4281\":[\"紧急集合 / 聚会\",10061,\"AHOI2008\"],\"洛谷-P3193\":[\"GT考试\",3699,\"HNOI2008\"],\"HDU-6087\":[\"Rikka with Sequence\",110,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2017+Multi-University+Training+Contest+-+Team+5\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2017 Multi-University Training Contest - Team 5 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-757G\":[\"Can Bash Save the Day?\",546,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/757\\\"\\u003eCodecraft-17 and Codeforces Round 391 (Div. 1 + Div. 2, combined)\\u003c/a\\u003e\"],\"AtCoder-abc221_h\":[\"Count Multiset\",124,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc221\\\"\\u003eAtCoder Beginner Contest 221\\u003c/a\\u003e\"],\"洛谷-P6105\":[\"y-fast trie\",641,\"Ynoi2010\"],\"CodeForces-1446D2\":[\"Frequency Problem (Hard Version)\",1343,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1446\\\"\\u003eCodeforces Round 683 (Div. 1, by Meet IT)\\u003c/a\\u003e\"],\"CodeChef-DGCD\":[\"Dynamic GCD\",467,\"nikhil_adm\"],\"CodeForces-340E\":[\"Iahub and Permutations\",2539,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/340\\\"\\u003eCodeforces Round 198 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-P8528\":[\"铃原露露\",180,\"Ynoi2003\"],\"HDU-5683\":[\"zxa and xor\",131,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dBestCoder+Round+%2383\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e BestCoder Round #83 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-1750D\":[\"Count GCD\",5670,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1750\\\"\\u003eCodeTON Round 3 (Div. 1 + Div. 2, Rated, Prizes!)\\u003c/a\\u003e\"],\"洛谷-P9061\":[\"Optimal Ordered Problem Solver\",52,\"Ynoi2002\"],\"洛谷-P7447\":[\"rgxsxrs\",453,\"Ynoi2007\"],\"AtCoder-arc148_e\":[\"≥ K\",88,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc148\\\"\\u003eAtCoder Regular Contest 148\\u003c/a\\u003e\"],\"洛谷-P7561\":[\"道路の建設案 (Road Construction)\",413,\"JOISC 2021 Day2\"],\"洛谷-P9069\":[\"堕天作战 TEST_98\",135,\"Ynoi Easy Round 2022\"],\"洛谷-P6478\":[\"游戏\",1473,\"NOI Online #2 提高组\"],\"洛谷-P3402\":[\"可持久化并查集\",8489,null],\"洛谷-P3648\":[\"序列分割\",4068,\"APIO2014\"],\"洛谷-P9989\":[\"TEST_69\",466,\"Ynoi Easy Round 2023\"],\"CodeForces-1838E\":[\"Count Supersequences\",1399,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1838\\\"\\u003eCodeforces Round 877 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-P5829\":[\"失配树\",2824,\"模板\"],\"CodeForces-1761D\":[\"Carry Bit\",2358,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1761\\\"\\u003ePinely Round 1 (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1555F\":[\"Good Graph\",850,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1555\\\"\\u003eEducational Codeforces Round 112 (Rated for Div. 2)\\u003c/a\\u003e\"],\"AtCoder-abc305_h\":[\"Shojin\",10,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc305\\\"\\u003eKYOCERA Programming Contest 2023(AtCoder Beginner Contest 305)\\u003c/a\\u003e\"],\"CodeForces-1163F\":[\"Indecisive Taxi Fee\",913,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1163\\\"\\u003eCodeforces Round 558 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1175G\":[\"Yet Another Partiton Problem\",478,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1175\\\"\\u003eEducational Codeforces Round 66 (Rated for Div. 2)\\u003c/a\\u003e\"],\"HDU-5692\":[\"Snacks\",1091,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2016%26quot%3B%B0%D9%B6%C8%D6%AE%D0%C7%26quot%3B+-+%B3%F5%C8%FC%A3%A8Astar+Round2A%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2016\\\"百度之星\\\" - 初赛(Astar Round2A) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-P4062\":[\"Yazid 的新生舞会\",1410,\"Code+#1\"],\"洛谷-P4180\":[\"严格次小生成树\",12382,\"BJWC2010\"],\"洛谷-P2680\":[\"运输计划\",16377,\"NOIP2015 提高组\"],\"TopCoder-12004\":[\"SetAndSet\",95,\"\\u003ca href\\u003d\\\"https://community.topcoder.com/tc?module\\u003dProblemDetail\\u0026amp;rd\\u003d14737\\u0026amp;pm\\u003d12004\\\"\\u003eSingle Round Match 545 Round 1 - Division I, Level Three\\u003c/a\\u003e\"],\"洛谷-P4069\":[\"游戏\",1847,\"SDOI2016\"],\"洛谷-P1471\":[\"方差\",8830,null],\"洛谷-P5278\":[\"算术天才⑨与等差数列\",1540,null]}","joined":false,"groups":{}},"managingGroups":{},"author":"hellolin","updateTime":1711242262000,"title":"MX 2024 S+N Xuanying Plan Workbook (Unofficial)","dislikeCnt":0,"content":"\u003cdiv align\u003d\"center\"\u003e\n\u003ch2\u003e\nMX 2024 S+N Xuanying Plan Workbook\n\u003c/h2\u003e\n\u003ch5\u003e\n\u003ci\u003eUnofficial collection. Made by \u003ca href\u003d\"https://hellolin.top/\" target\u003d\"_blank\"\u003ehellolin\u003c/a\u003e.\u003c/i\u003e\n\u003c/h5\u003e\n\u003c/div\u003e\n\n---\n\n另一个~~你们可能见过的~~大题单:[ZR 2023 Summer C Workbook](https://vjudge.net/article/3852)\n\n**请注意,在 VJudge 上,比赛的提交直到结束后才算入题库提交,所以即使在未结束的比赛中过了某题,下面的列表中也不会显示 AC。**\n\n## Day0 - 2024.02.14 - 模拟赛\n\n[link](http://mna.wang/contest/516)\n\n## Day1 - 2024.02.15 - 图论\n\n- 专题:最短路、生成树、LCA、连通分量、差分约束、拓扑排序、建图技巧以及优化\n- 讲师:朱智睿\n- 题目:29 道\n\n[problem:CodeForces-715B]\n[problem:洛谷-P2149]\n[problem:洛谷-P5304]\n[problem:洛谷-P5305]\n[problem:洛谷-P2371]\n[problem:CodeForces-786B]\n[problem:洛谷-P4001]\n[problem:洛谷-P7516]\n[problem:CodeForces-1163F]\n[problem:洛谷-P4180]\n[problem:CodeForces-1416D]\n[problem:洛谷-P4234]\n[problem:洛谷-P5633]\n[problem:洛谷-P5631]\n[problem:洛谷-P3398]\n[problem:洛谷-P4281]\n[problem:洛谷-P3627]\n[problem:CodeForces-467D]\n[problem:洛谷-P2860]\n[problem:洛谷-P3225]\n[problem:SPOJ-BUSINESS]\n[problem:UVA-1108]\n[problem:洛谷-P4630]\n[problem:CodeForces-487E]\n[problem:洛谷-P3275]\n[problem:洛谷-P7624]\n[problem:洛谷-P7831]\n[problem:CodeForces-1903F]\n[problem:CodeForces-587D]\n\n## Day2 - 2024.02.16 - 数据结构\n\n- 专题:栈、队列、并查集、ST、树状数组、线段树等基础数据结构\n- 讲师:lxl\n- 题目:61 道(全部课件,按课件顺序)\n\n[problem:洛谷-P2391]\n[problem:洛谷-P6033]\n[problem:洛谷-P2827]\n[problem:洛谷-P1197]\n[problem:洛谷-P2023]\n[problem:洛谷-P4513]\n[problem:洛谷-P2042]\n[problem:洛谷-P5482]\n[problem:洛谷-P1471]\n[problem:洛谷-P2757]\n[problem:洛谷-P6327]\n[problem:洛谷-P7706]\n[problem:洛谷-P6864]\n[problem:HDU-6013]\n[problem:洛谷-P4198]\n[problem:洛谷-P5278]\n[problem:CodeChef-DGCD]\n[problem:洛谷-P4036]\n[problem:洛谷-P4344]\n[problem:洛谷-P3215]\n[problem:洛谷-P6617]\n[problem:洛谷-T372191]\n[problem:洛谷-T367829]\n[problem:洛谷-P3586]\n[problem:HDU-5683]\n[problem:洛谷-P6105]\n[problem:洛谷-P5069]\n[problem:洛谷-P4069]\n[problem:洛谷-P4097]\n[problem:洛谷-P5608]\n[problem:CodeForces-280D]\n[problem:洛谷-P7739]\n[problem:洛谷-P8496]\n[problem:CodeForces-444C]\n[problem:CodeForces-453E]\n[problem:洛谷-P5066]\n[problem:LibreOJ-6777]\n[problem:洛谷-P9061]\n[problem:洛谷-P6272]\n[problem:洛谷-P5610]\n[problem:洛谷-P4145]\n[problem:CodeForces-438D]\n[problem:HDU-6315]\n[problem:HDU-5634]\n[problem:HDU-5997]\n[problem:CodeForces-702F]\n[problem:洛谷-P9989]\n[problem:LibreOJ-6029]\n[problem:UniversalOJ-228]\n[problem:CodeForces-679E]\n[problem:LibreOJ-504]\n[problem:洛谷-P5068]\n[problem:洛谷-P7447]\n[problem:洛谷-P9069]\n[problem:洛谷-P3747]\n[problem:Gym-104065B]\n[problem:LibreOJ-3273]\n[problem:CodeForces-1446D2]\n[problem:洛谷-P4062]\n[problem:洛谷-P5073]\n[problem:LibreOJ-3673]\n\n## Day3 - 2024.02.17 - 数据结构\n\n- 专题:主席树、树链剖分、虚树等高级数据结构\n- 讲师:lxl\n- 题目:52 道(全部课件)\n\n[problem:洛谷-P3919]\n[problem:洛谷-P3834]\n[problem:洛谷-P4592]\n[problem:洛谷-P5795]\n[problem:洛谷-P3567]\n[problem:洛谷-P2839]\n[problem:UniversalOJ-218]\n[problem:洛谷-P4587]\n[problem:LibreOJ-6144]\n[problem:CodeForces-464E]\n[problem:洛谷-P3402]\n[problem:HDU-6087]\n[problem:HDU-5118]\n[problem:黑暗爆炸-3551]\n[problem:HDU-6378]\n[problem:洛谷-P3293]\n[problem:CodeForces-543E]\n[problem:洛谷-P4899]\n[problem:洛谷-P3302]\n[problem:洛谷-P7561]\n[problem:CodeForces-383C]\n[problem:黑暗爆炸-3306]\n[problem:洛谷-P3128]\n[problem:洛谷-P1600]\n[problem:洛谷-P2680]\n[problem:洛谷-P4216]\n[problem:洛谷-P4219]\n[problem:洛谷-P5838]\n[problem:HDU-5692]\n[problem:洛谷-P4211]\n[problem:洛谷-P5354]\n[problem:HDU-5709]\n[problem:LibreOJ-6038]\n[problem:51Nod-1766]\n[problem:洛谷-T11738]\n[problem:CodeForces-757G]\n[problem:CodeForces-696E]\n[problem:洛谷-P5314]\n[problem:洛谷-P4551]\n[problem:洛谷-P6072]\n[problem:LibreOJ-6276]\n[problem:黑暗爆炸-3159]\n[problem:LibreOJ-6498]\n[problem:CodeForces-536E]\n[problem:CodeForces-960H]\n[problem:CodeForces-1344E]\n[problem:CodeForces-482E]\n[problem:CodeForces-1017G]\n[problem:洛谷-P7880]\n[problem:洛谷-P8528]\n[problem:洛谷-P6071]\n[problem:LibreOJ-3676]\n\n## Day4 - 2024.02.18 - 模拟赛与杂题选讲\n\n[link](http://mna.wang/contest/537)\n\n- 讲师:朱智睿\n- 题目:8 道\n\n[problem:CodeForces-1584D]\n[problem:CodeForces-1605D]\n[problem:CodeForces-1548C]\n[problem:CodeForces-1580D]\n[problem:CodeForces-1552E]\n[problem:CodeForces-1552F]\n[problem:CodeForces-1554E]\n[problem:CodeForces-1555F]\n\n## Day5 - 2024.02.19 - 动态规划\n\n- 专题:DP 及其优化\n- 讲师:吴戈\n- 题目:17 道\n\n[problem:洛谷-P4141]\n[problem:洛谷-P2371]\n[problem:洛谷-P8392]\n[problem:洛谷-P4322]\n[problem:黑暗爆炸-4380]\n[problem:AtCoder-agc026_d]\n[problem:CodeForces-1372E]\n[problem:洛谷-P6563]\n[problem:洛谷-P1912]\n[problem:CodeForces-868F]\n[problem:LibreOJ-6039]\n[problem:洛谷-P3648]\n[problem:CodeForces-1175G]\n[problem:CodeForces-321E]\n[problem:AtCoder-abc305_h]\n[problem:CodeForces-713C]\n[problem:AtCoder-abc217_h]\n\n## Day6 - 2024.02.20 - 字符串\n\n- 专题:hash、KMP、exKMP、Trie、AC 自动机等\n- 讲师:陈鹏旭\n- 题目:19 道\n\n[problem:洛谷-P5446]\n[problem:洛谷-P7114]\n[problem:洛谷-P3435]\n[problem:洛谷-P2375]\n[problem:洛谷-P5829]\n[problem:HDU-7138]\n[problem:洛谷-P3193]\n[problem:洛谷-P2922]\n[problem:洛谷-P5357]\n[problem:洛谷-P2414]\n[problem:洛谷-P3041]\n[problem:洛谷-P2444]\n[problem:洛谷-P5329]\n[problem:洛谷-P3426]\n[problem:洛谷-P6216]\n[problem:CodeForces-1654F]\n[problem:Gym-103447L]\n[problem:洛谷-P6698]\n[problem:CodeForces-1286E]\n\n## Day7 - 2024.02.21 - 模拟赛与杂题选讲\n\n[link](http://mna.wang/contest/539)\n\n## Day8 - 2024.02.22 - 计数 DP\n\n- 专题:计数 DP\n- 讲师:吴戈\n- 题目:24 道\n\n[problem:AtCoder-arc154_e]\n[problem:CodeForces-340E]\n[problem:AtCoder-agc005_d]\n[problem:CodeForces-1530F]\n[problem:CodeForces-1093F]\n[problem:CodeForces-1111E]\n[problem:Gym-104095D]\n[problem:AtCoder-agc023_e]\n[problem:CodeForces-917D]\n[problem:CodeForces-1930E]\n[problem:AtCoder-agc013_e]\n[problem:洛谷-P7914]\n[problem:AtCoder-agc002_f]\n[problem:CodeForces-1782F]\n[problem:AtCoder-arc068_d]\n[problem:LibreOJ-3276]\n[problem:洛谷-P7519]\n[problem:洛谷-P10141]\n[problem:洛谷-P5664]\n[problem:AtCoder-arc160_d]\n[problem:CodeForces-1060F]\n[problem:CodeForces-1603E]\n[problem:AtCoder-arc156_d]\n[problem:AtCoder-arc132_e]\n\n## Day9 - 2024.02.23 - 数论\n\n- 专题:组合数学、概率与期望、容斥等\n- 讲师:宋佳兴\n- 题目:23 道\n\n[problem:CodeForces-1327E]\n[problem:CodeForces-1761D]\n[problem:AtCoder-abc134_f]\n[problem:CodeForces-1838E]\n[problem:HDU-4336]\n[problem:CodeForces-1778D]\n[problem:AtCoder-agc049_a]\n[problem:CodeForces-1874D]\n[problem:AtCoder-abc299_h]\n[problem:AtCoder-abc270_h]\n[problem:TopCoder-17483]\n[problem:TopCoder-7295]\n[problem:CodeForces-1750D]\n[problem:TopCoder-11608]\n[problem:AtCoder-abc221_h]\n[problem:洛谷-P6478]\n[problem:TopCoder-12004]\n[problem:AtCoder-arc148_e]\n[problem:TopCoder-14102]\n[problem:LibreOJ-3080]\n[problem:CodeForces-1842G]\n[problem:AtCoder-agc050_d]\n[problem:AtCoder-abc242_h]\n\n## Day10 - 2024.02.24 - 模拟赛与杂题选讲\n\n[link](http://mna.wang/contest/541)","threadId":182556,"likeCnt":7,"createTime":1707919611000,"isWorkbook":true,"viewCnt":1102,"openness":2,"fav":false,"id":4592,"trustable":false}