Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"洛谷-P2323\":[\"公路修建问题\",2801,\"HNOI2006\"],\"AtCoder-agc064_b\":[\"Red and Blue Spanning Tree\",524,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/agc064\\\"\\u003eAtCoder Grand Contest 064\\u003c/a\\u003e\"],\"洛谷-P2327\":[\"扫雷\",7650,\"SCOI2005\"],\"UVA-11174\":[\"Stand in a Line\",633,null],\"HDU-2077\":[\"汉诺塔IV\",9671,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dACM%B3%CC%D0%F2%C9%E8%BC%C6%C6%DA%C4%A9%BF%BC%CA%D4_%C8%C8%C9%ED%C8%FC%28%B8%D0%D0%BB+xhd+%26amp%3B+8600%29\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e ACM程序设计期末考试_热身赛(感谢 xhd \\u0026amp; 8600) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-1841F\":[\"Monocarp and a Strategic Game\",486,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1841\\\"\\u003eEducational Codeforces Round 150 (Rated for Div. 2)\\u003c/a\\u003e\"],\"计蒜客-T1859\":[\"奇怪的电梯\",1445,null],\"计蒜客-T1738\":[\"地毯\",1842,null],\"LibreOJ-10013\":[\"曲线\",2046,\"一本通 1.2 例 3\"],\"AtCoder-arc161_c\":[\"Dyed by Majority (Odd Tree)\",573,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc161\\\"\\u003eAtCoder Regular Contest 161\\u003c/a\\u003e\"],\"CodeForces-794E\":[\"Choosing Carrot\",675,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/794\\\"\\u003eTinkoff Challenge - Final Round (Codeforces Round 414, rated, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"LibreOJ-10014\":[\"数列分段 II\",2594,\"一本通 1.2 练习 1\"],\"洛谷-P2330\":[\"繁忙的都市\",24157,\"SCOI2005\"],\"LibreOJ-10017\":[\"传送带\",1015,\"一本通 1.2 练习 4\"],\"洛谷-P1364\":[\"医院设置\",28301,null],\"洛谷-P5960\":[\"差分约束\",18301,\"模板\"],\"LibreOJ-10019\":[\"生日蛋糕\",1899,\"一本通 1.3 例 2\"],\"OpenJ_Bailian-2980\":[\"大整数乘法\",5016,\"程序设计实习2007\"],\"计蒜客-T2011\":[\"借教室\",542,\"[NOIP提高组 2012]\"],\"洛谷-P3304\":[\"直径\",2801,\"SDOI2013\"],\"CodeForces-1779E\":[\"Anya\\u0027s Simultaneous Exhibition\",1718,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1779\\\"\\u003eHello 2023\\u003c/a\\u003e\"],\"洛谷-P2218\":[\"覆盖问题\",1084,\"HAOI2007\"],\"CodeForces-1036F\":[\"Relatively Prime Powers\",1464,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1036\\\"\\u003eEducational Codeforces Round 50 (Rated for Div. 2)\\u003c/a\\u003e\"],\"计蒜客-T1847\":[\"进制转换\",643,null],\"OpenJ_Bailian-2737\":[\"大整数除法\",2765,\"\"],\"计蒜客-T1723\":[\"约瑟夫问题\",1769,null],\"洛谷-P2580\":[\"于是他错误的点名开始了\",32737,null],\"洛谷-P1491\":[\"集合位置\",2607,null],\"AtCoder-arc159_d\":[\"LIS 2\",447,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc159\\\"\\u003eAtCoder Regular Contest 159\\u003c/a\\u003e\"],\"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\"],\"AtCoder-arc159_c\":[\"Permutation Addition\",250,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc159\\\"\\u003eAtCoder Regular Contest 159\\u003c/a\\u003e\"],\"AtCoder-arc159_b\":[\"GCD Subtraction\",950,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc159\\\"\\u003eAtCoder Regular Contest 159\\u003c/a\\u003e\"],\"洛谷-P1495\":[\"中国剩余定理(CRT)/ 曹冲养猪\",23726,\"模板\"],\"洛谷-P2221\":[\"高速公路\",2386,\"HAOI2012\"],\"Gym-102978I\":[\"Inverse Problem\",351,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/102978\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eXXI Open Cup, Grand Prix of Tokyo\\u003c/a\\u003e\"],\"洛谷-P4767\":[\"邮局\",4333,\"IOI2000\"],\"洛谷-P2107\":[\"小Z的AK计划\",2998,null],\"HDU-1207\":[\"汉诺塔II\",6047,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dGardon-DYGG+Contest+2\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Gardon-DYGG Contest 2 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"AtCoder-abc273_g\":[\"Row Column Sums 2\",117,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc273\\\"\\u003ePanasonic Programming Contest 2022(AtCoder Beginner Contest 273)\\u003c/a\\u003e\"],\"Gym-104053L\":[\"Station of Fate\",1265,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/104053\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2022 China Collegiate Programming Contest (CCPC) Guangzhou Onsite\\u003c/a\\u003e\"],\"OpenJ_Bailian-2774\":[\"木材加工\",2345,\"NOIP 2004\"],\"LibreOJ-10150\":[\"括号配对\",1284,\"一本通 5.1 练习 1\"],\"LibreOJ-10151\":[\"分离与合体\",739,\"一本通 5.1 练习 2\"],\"LibreOJ-10152\":[\"矩阵取数游戏\",783,\"一本通 5.1 练习 3\"],\"洛谷-P9304\":[\"3-1\",607,\"DTOI-5\"],\"AtCoder-arc162_b\":[\"Insertion Sort 2\",1105,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc162\\\"\\u003eAtCoder Regular Contest 162\\u003c/a\\u003e\"],\"洛谷-P1382\":[\"楼房\",1386,null],\"AtCoder-arc162_c\":[\"Mex Game on Tree\",647,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc162\\\"\\u003eAtCoder Regular Contest 162\\u003c/a\\u003e\"],\"CodeForces-954I\":[\"Yet Another String Matching Problem\",1046,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/954\\\"\\u003eEducational Codeforces Round 40 (Rated for Div. 2)\\u003c/a\\u003e\"],\"Gym-102978F\":[\"Find the LCA\",90,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/102978\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eXXI Open Cup, Grand Prix of Tokyo\\u003c/a\\u003e\"],\"LibreOJ-2559\":[\"消防局的设立\",205,\"HNOI2003\"],\"洛谷-P7244\":[\"章节划分\",301,null],\"洛谷-P1144\":[\"最短路计数\",40095,null],\"CodeForces-1777D\":[\"Score of a Tree\",3243,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1777\\\"\\u003eCodeforces Round 845 (Div. 2) and ByteRace 2023\\u003c/a\\u003e\"],\"Gym-102832L\":[\"Coordinate Paper\",153,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/102832\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2020 China Collegiate Programming Contest Changchun Onsite\\u003c/a\\u003e\"],\"洛谷-P4779\":[\"单源最短路径(标准版)\",125526,\"模板\"],\"洛谷-P2119\":[\"魔法阵\",7915,\"NOIP2016 普及组\"],\"洛谷-P7809\":[\"01 序列\",749,\"JRKSJ R2\"],\"OpenJ_Bailian-4147\":[\"汉诺塔问题(Tower of Hanoi)\",4029,\"重庆科技学院 WJQ\"],\"LibreOJ-10020\":[\"小木棍\",2285,\"一本通 1.3 例 3\"],\"Gym-292435A\":[\"高精度加减法\",210,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/292435\\u0027 target\\u003d\\u0027_blank\\u0027\\u003etest\\u003c/a\\u003e\"],\"LibreOJ-10021\":[\"Addition Chains\",1698,\"一本通 1.3 例 4\"],\"LibreOJ-10143\":[\"营业额统计\",1352,\"一本通 4.6 例 1\"],\"洛谷-P1390\":[\"公约数的和\",6199,null],\"洛谷-P1392\":[\"取数\",1465,null],\"LibreOJ-10148\":[\"能量项链\",1646,\"一本通 5.1 例 2\"],\"LibreOJ-10149\":[\"凸多边形的划分\",1184,\"一本通 5.1 例 3\"],\"AtCoder-agc062_b\":[\"Split and Insert\",209,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/agc062\\\"\\u003eAtCoder Grand Contest 062\\u003c/a\\u003e\"],\"OpenJ_Bailian-1220\":[\"NUMBER BASE CONVERSION\",76,\"Greater New York 2002\"],\"LibreOJ-2545\":[\"守卫\",249,\"JXOI2018\"],\"AtCoder-agc062_c\":[\"Mex of Subset Sum\",220,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/agc062\\\"\\u003eAtCoder Grand Contest 062\\u003c/a\\u003e\"],\"HDU-5828\":[\"Rikka with Sequence\",473,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2016+Multi-University+Training+Contest+8\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2016 Multi-University Training Contest 8 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-P1833\":[\"樱花\",19589,null],\"AtCoder-arc073_d\":[\"Many Moves\",144,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc073\\\"\\u003eAtCoder Regular Contest 073\\u003c/a\\u003e\"],\"OpenJ_Bailian-2559\":[\"Largest Rectangle in a Histogram\",305,\"Ulm Local 2003\"],\"洛谷-P1835\":[\"素数密度\",13451,null],\"OpenJ_Bailian-2798\":[\"2进制转化为16进制\",3105,\"\"],\"CodeForces-1574B\":[\"Combinatorics Homework\",17455,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1574\\\"\\u003eEducational Codeforces Round 114 (Rated for Div. 2)\\u003c/a\\u003e\"],\"Gym-104160L\":[\"Tavern Chess\",973,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/104160\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eThe 2022 ICPC Asia Shenyang Regional Contest (The 1st Universal Cup, Stage 1: Shenyang)\\u003c/a\\u003e\"],\"HDU-1465\":[\"不容易系列之一\",12356,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dACM%CA%EE%C6%DA%BC%AF%D1%B5%B6%D3%C1%B7%CF%B0%C8%FC%A3%A8%BE%C5%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e ACM暑期集训队练习赛(九) \\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\"],\"CodeForces-798D\":[\"Mike and distribution\",2219,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/798\\\"\\u003eCodeforces Round 410 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-P2251\":[\"质量检测\",15587,null],\"洛谷-P1040\":[\"加分二叉树\",32164,\"NOIP2003 提高组\"],\"洛谷-P6175\":[\"无向图的最小环问题\",7384,null],\"洛谷-P3223\":[\"排队\",2773,\"HNOI2012\"],\"洛谷-P4551\":[\"最长异或路径\",12186,null],\"洛谷-P1168\":[\"中位数\",32158,null],\"洛谷-P2015\":[\"二叉苹果树\",23728,null],\"洛谷-P2014\":[\"选课\",33992,\"CTSC1997\"],\"洛谷-P1169\":[\"棋盘制作\",8537,\"ZJOI2007\"],\"洛谷-P1966\":[\"火柴排队\",21818,\"NOIP2013 提高组\"],\"洛谷-P5648\":[\"Mivik的神力\",505,null],\"CodeForces-1101D\":[\"GCD Counting\",4657,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1101\\\"\\u003eEducational Codeforces Round 58 (Rated for Div. 2)\\u003c/a\\u003e\"],\"洛谷-P1967\":[\"货车运输\",29583,\"NOIP2013 提高组\"],\"HDU-2563\":[\"统计问题\",5166,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%C9%DC%D0%CB%CD%D0%C6%D5%D0%C5%CF%A2%BC%BC%CA%F5%D6%B0%D2%B5%BC%BC%CA%F5%D1%A7%D4%BA%A1%AA%A1%AA%B5%DA%B6%FE%BD%EC%B5%E7%C4%D4%CE%C4%BB%AF%BD%DA%B3%CC%D0%F2%C9%E8%BC%C6%BE%BA%C8%FC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 绍兴托普信息技术职业技术学院——第二届电脑文化节程序设计竞赛 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"Gym-103648K\":[\"Food Search\",17,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/103648\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eUTPC Contest 04-08-22 Div. 1 (Advanced)\\u003c/a\\u003e\"],\"Gym-104053E\":[\"Elevator\",1051,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/104053\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2022 China Collegiate Programming Contest (CCPC) Guangzhou Onsite\\u003c/a\\u003e\"],\"Gym-104053H\":[\"GameX\",1104,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/104053\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2022 China Collegiate Programming Contest (CCPC) Guangzhou Onsite\\u003c/a\\u003e\"],\"黑暗爆炸-2124\":[\"等差子序列\",152,\"\"],\"洛谷-P3350\":[\"旅行者\",914,\"ZJOI2016\"],\"洛谷-P6186\":[\"冒泡排序\",2950,\"NOI Online #1 提高组\"],\"洛谷-P3596\":[\"MOD\",231,\"POI2015\"],\"洛谷-P4568\":[\"飞行路线\",16634,\"JLOI2011\"],\"洛谷-P5536\":[\"核心城市\",4529,\"XR-3\"],\"洛谷-P5656\":[\"二元一次不定方程 (exgcd)\",7595,\"模板\"],\"AtCoder-agc063_c\":[\"Add Mod Operations\",177,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/agc063\\\"\\u003eAtCoder Grand Contest 063\\u003c/a\\u003e\"],\"洛谷-P1972\":[\"HH的项链\",24052,\"SDOI2009\"],\"LibreOJ-3299\":[\"冰火战士\",1074,\"联合省选 2020 A | B\"],\"CodeForces-1003D\":[\"Coins and Queries\",8216,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1003\\\"\\u003eCodeforces Round 494 (Div. 3)\\u003c/a\\u003e\"],\"洛谷-P1616\":[\"疯狂的采药\",87400,null],\"LibreOJ-3291\":[\"城墙\",62,\"CEOI2014\"],\"AtCoder-arc160_b\":[\"Triple Pair\",899,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc160\\\"\\u003eAtCoder Regular Contest 160\\u003c/a\\u003e\"],\"黑暗爆炸-4699\":[\"树上的最短路\",59,\"\"],\"AtCoder-arc160_c\":[\"Power Up\",523,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc160\\\"\\u003eAtCoder Regular Contest 160\\u003c/a\\u003e\"],\"洛谷-P1063\":[\"能量项链\",45803,\"NOIP2006 提高组\"],\"计蒜客-T1597\":[\"迷宫(三)\",2733,null],\"洛谷-P3366\":[\"最小生成树\",126586,\"模板\"],\"洛谷-P1064\":[\"金明的预算方案\",45100,\"NOIP2006 提高组\"],\"洛谷-P7167\":[\"Fountain\",2957,\"eJOI2020 Day1\"],\"CodeForces-283E\":[\"Cow Tennis Tournament\",766,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/283\\\"\\u003eCodeforces Round 174 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-161C\":[\"Abracadabra\",682,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/161\\\"\\u003eVK Cup 2012 Round 1\\u003c/a\\u003e\"],\"计蒜客-T2431\":[\"激光炸弹\",1285,\"[HNOI2003]\"],\"CodeForces-173B\":[\"Chamber of Secrets\",3508,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/173\\\"\\u003eCroc Champ 2012 - Round 1\\u003c/a\\u003e\"],\"洛谷-P1983\":[\"车站分级\",23058,\"NOIP2013 普及组\"],\"CodeForces-1648A\":[\"Weird Sum\",11854,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1648\\\"\\u003eCodeforces Round 775 (Div. 1, based on Moscow Open Olympiad in Informatics)\\u003c/a\\u003e\"],\"洛谷-P3801\":[\"红色的幻想乡\",1885,null],\"HDU-1257\":[\"最少拦截系统\",26050,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%D5%E3%BD%AD%B9%A4%D2%B5%B4%F3%D1%A7%B5%DA%CB%C4%BD%EC%B4%F3%D1%A7%C9%FA%B3%CC%D0%F2%C9%E8%BC%C6%BE%BA%C8%FC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 浙江工业大学第四届大学生程序设计竞赛 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LibreOJ-135\":[\"二维树状数组 3:区间修改,区间查询\",1798,null],\"CodeForces-739E\":[\"Gosha is hunting\",2275,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/739\\\"\\u003eCodeforces Round 381 (Div. 1)\\u003c/a\\u003e\"],\"LibreOJ-134\":[\"二维树状数组 2:区间修改,单点查询\",1320,null],\"Gym-104160D\":[\"DRX vs. T1\",1619,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/104160\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eThe 2022 ICPC Asia Shenyang Regional Contest (The 1st Universal Cup, Stage 1: Shenyang)\\u003c/a\\u003e\"],\"洛谷-P3372\":[\"线段树 1\",157579,\"模板\"],\"洛谷-P2161\":[\"会场预约\",4535,\"SHOI2009\"],\"洛谷-P7972\":[\"Self Permutation\",101,\"KSN2021\"],\"洛谷-P3373\":[\"线段树 2\",65997,\"模板\"],\"洛谷-P3370\":[\"字符串哈希\",68439,\"模板\"],\"洛谷-P7974\":[\"Delivering Balls\",159,\"KSN2021\"],\"洛谷-P3371\":[\"单源最短路径(弱化版)\",123368,\"模板\"],\"LibreOJ-131\":[\"树状数组 2 :区间修改,单点查询\",4854,null],\"黑暗爆炸-4563\":[\"放棋子\",28,\"Haoi2016\"],\"LibreOJ-130\":[\"树状数组 1 :单点修改,区间查询\",9086,null],\"LibreOJ-133\":[\"二维树状数组 1:单点修改,区间查询 \",3269,null],\"洛谷-P3374\":[\"树状数组 1\",95497,\"模板\"],\"LibreOJ-132\":[\"树状数组 3 :区间修改,区间查询\",7833,null],\"洛谷-P3375\":[\"KMP\",78058,\"模板\"],\"洛谷-P5673\":[\"Picking Gifts\",299,\"SWTR-2\"],\"洛谷-P2168\":[\"荷马史诗\",8288,\"NOI2015\"],\"洛谷-P3810\":[\"三维偏序(陌上花开)\",17770,\"模板\"],\"洛谷-P3378\":[\"堆\",59502,\"模板\"],\"洛谷-P4588\":[\"数学计算\",9860,\"TJOI2018\"],\"洛谷-P5557\":[\"旅行\",219,null],\"洛谷-P1631\":[\"序列合并\",20482,null],\"洛谷-P3379\":[\"最近公共祖先(LCA)\",124438,\"模板\"],\"Gym-103960K\":[\"Kalel, the Jumping Frog\",104,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/103960\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2022-2023 ICPC Brazil Subregional Programming Contest\\u003c/a\\u003e\"],\"洛谷-P3811\":[\"模意义下的乘法逆元\",36384,\"模板\"],\"洛谷-P1757\":[\"通天之分组背包\",28351,null],\"Gym-103960I\":[\"Intercepting Information\",2414,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/103960\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2022-2023 ICPC Brazil Subregional Programming Contest\\u003c/a\\u003e\"],\"洛谷-P1517\":[\"高精求小数幂\",1323,null],\"HDU-1263\":[\"水果\",6418,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%D5%E3%BD%AD%B9%A4%D2%B5%B4%F3%D1%A7%B5%DA%CB%C4%BD%EC%B4%F3%D1%A7%C9%FA%B3%CC%D0%F2%C9%E8%BC%C6%BE%BA%C8%FC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 浙江工业大学第四届大学生程序设计竞赛 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"Gym-100418C\":[\"Substrings\",70,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/100418\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2013-2014 BSUIR Open Programming Championship. Final\\u003c/a\\u003e\"],\"洛谷-P1081\":[\"开车旅行\",10126,\"NOIP2012 提高组\"],\"Gym-100418A\":[\"A+-B\",578,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/100418\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2013-2014 BSUIR Open Programming Championship. Final\\u003c/a\\u003e\"],\"洛谷-P3383\":[\"线性筛素数\",92689,\"模板\"],\"Gym-100418D\":[\"BOPC\",274,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/100418\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2013-2014 BSUIR Open Programming Championship. Final\\u003c/a\\u003e\"],\"Gym-100418J\":[\"Lucky tickets\",247,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/100418\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2013-2014 BSUIR Open Programming Championship. Final\\u003c/a\\u003e\"],\"CodeForces-471D\":[\"MUH and Cube Walls\",8685,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/471\\\"\\u003eCodeforces Round 269 (Div. 2)\\u003c/a\\u003e\"],\"Gym-100418H\":[\"Equalize\",109,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/100418\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2013-2014 BSUIR Open Programming Championship. Final\\u003c/a\\u003e\"],\"洛谷-P3385\":[\"负环\",38645,\"模板\"],\"洛谷-P1880\":[\"石子合并\",61220,\"NOI1995\"],\"洛谷-P9488\":[\"ZHY 的生成树\",380,null],\"CodeForces-373E\":[\"Watching Fireworks is Fun\",29,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/373\\\"\\u003eCodeforces Round 219 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-P5569\":[\"石子合并\",1950,\"SDOI2008\"],\"计蒜客-T1320\":[\"子矩阵求和\",1717,null],\"洛谷-P1886\":[\"滑动窗口 /【模板】单调队列\",67967,null],\"计蒜客-T2092\":[\"双栈排序\",237,null],\"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\"],\"51Nod-1081\":[\"子段求和\",3982,\"李陶冶\"],\"CodeForces-1674B\":[\"Dictionary\",26291,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1674\\\"\\u003eCodeforces Round 786 (Div. 3)\\u003c/a\\u003e\"],\"洛谷-P1091\":[\"合唱队形\",66776,\"NOIP2004 提高组\"],\"计蒜客-T1448\":[\"绝对值排序\",1569,null],\"CodeForces-983D\":[\"Arkady and Rectangles\",351,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/983\\\"\\u003eCodeforces Round 483 (Div. 1) [Thanks, Botan Investments and Victor Shaburov!]\\u003c/a\\u003e\"],\"洛谷-P1096\":[\"Hanoi 双塔问题\",22926,\"NOIP2007 普及组\"],\"洛谷-P3398\":[\"仓鼠找 sugar\",9734,null],\"黑暗爆炸-4221\":[\"JOI2012 kangaroo\",98,\"\"],\"洛谷-P3953\":[\"逛公园\",10558,\"NOIP2017 提高组\"],\"CodeForces-166E\":[\"Tetrahedron\",21599,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/166\\\"\\u003eCodeforces Round 113 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-P1896\":[\"互不侵犯\",28403,\"SCOI2005\"],\"洛谷-P1775\":[\"石子合并(弱化版)\",21848,null],\"洛谷-P1776\":[\"宝物筛选\",28806,null],\"洛谷-P2505\":[\"道路\",1502,\"HAOI2012\"],\"洛谷-P2504\":[\"聪明的猴子\",6857,\"HAOI2006\"],\"洛谷-P4929\":[\"舞蹈链(DLX)\",3702,\"模板\"],\"洛谷-B3611\":[\"传递闭包\",6825,\"模板\"],\"UVA-514\":[\"Rails\",21312,null],\"AtCoder-agc008_d\":[\"K-th K\",275,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/agc008\\\"\\u003eAtCoder Grand Contest 008\\u003c/a\\u003e\"],\"洛谷-P5584\":[\"Sunny\\u0027s Crystals\",124,\"SWTR-1\"],\"CodeForces-1848A\":[\"Vika and Her Friends\",16361,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1848\\\"\\u003eCodeforces Round 885 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1848B\":[\"Vika and the Bridge\",13411,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1848\\\"\\u003eCodeforces Round 885 (Div. 2)\\u003c/a\\u003e\"],\"计蒜客-T1555\":[\"二分查找(五)\",3737,null],\"黑暗爆炸-3043\":[\"IncDec Sequence\",1059,\"Poetize6\"],\"洛谷-P2871\":[\"Charm Bracelet S\",24433,\"USACO07DEC\"],\"计蒜客-T1556\":[\"二分查找(六)\",2276,null],\"洛谷-P2757\":[\"等差子序列\",2458,\"国家集训队\"],\"CodeForces-1200E\":[\"Compress Words\",7886,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1200\\\"\\u003eCodeforces Round 578 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1333E\":[\"Road to 1600\",1506,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1333\\\"\\u003eCodeforces Round 632 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-P3174\":[\"毛毛虫\",4219,\"HAOI2009\"],\"洛谷-P7775\":[\"VUK\",763,\"COCI2009-2010#2\"],\"洛谷-P2085\":[\"最小函数值\",16786,null],\"QOJ-3760\":[\"双向链表练习题\",37,\"\\u003ca href\\u003d\\\"https://qoj.ac/contest/907\\\"\\u003eThe 2019 Hunan Collegiate Programming Contest\\u003c/a\\u003e\"],\"LibreOJ-2603\":[\"国王游戏\",830,\"NOIP2012\"],\"UVA-12467\":[\"Secret Word\",1800,null],\"洛谷-P1433\":[\"吃奶酪\",31344,null],\"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\"],\"HDU-6514\":[\"Monitor\",1351,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2019%D6%D0%C9%BD%B4%F3%D1%A7%B3%CC%D0%F2%C9%E8%BC%C6%BE%BA%C8%FC%A3%A8%D6%D8%CF%D6%C8%FC%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2019中山大学程序设计竞赛(重现赛) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LibreOJ-10173\":[\"炮兵阵地\",1240,\"一本通 5.4 练习 2\"],\"HDU-1995\":[\"汉诺塔V\",6095,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dECJTU+2008+Spring+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e ECJTU 2008 Spring Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-P3865\":[\"ST 表\",74646,\"模板\"],\"LibreOJ-3128\":[\"Sunčanje\",127,\"COCI 2018.11\"],\"洛谷-P2657\":[\"windy 数\",20761,\"SCOI2009\"],\"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\"],\"Gym-103640K\":[\"KIARA is a Recursive Acronym\",1593,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/103640\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2021-2022 ACM-ICPC Latin American Regional Programming Contest\\u003c/a\\u003e\"],\"洛谷-P1328\":[\"生活大爆炸版石头剪刀布\",76587,\"NOIP2014 提高组\"],\"Gym-103640F\":[\"Fields Division\",1244,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/103640\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2021-2022 ACM-ICPC Latin American Regional Programming Contest\\u003c/a\\u003e\"],\"Gym-104460L\":[\"Digit Product\",936,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/104460\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eThe 2019 ICPC China Shaanxi Provincial Programming Contest\\u003c/a\\u003e\"],\"CodeForces-1303G\":[\"Sum of Prefix Sums\",778,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1303\\\"\\u003eEducational Codeforces Round 82 (Rated for Div. 2)\\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\"],\"HDU-1872\":[\"稳定排序\",3400,\"\\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\"],\"AtCoder-arc066_c\":[\"Addition and Subtraction Hard\",221,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc066\\\"\\u003eAtCoder Regular Contest 066\\u003c/a\\u003e\"],\"CodeForces-1799G\":[\"Count Voting\",739,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1799\\\"\\u003eCodeforces Round 854 by cybercats (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"洛谷-P4281\":[\"紧急集合 / 聚会\",10061,\"AHOI2008\"],\"HDU-1401\":[\"Solitaire\",1304,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dSouthwestern+Europe+2002\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Southwestern Europe 2002 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LibreOJ-2248\":[\"随机数生成器\",201,\"NOI2014\"],\"CodeForces-364E\":[\"Empty Rectangles\",587,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/364\\\"\\u003eCodeforces Round 213 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1394C\":[\"Boboniu and String\",975,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1394\\\"\\u003eCodeforces Round 664 (Div. 1)\\u003c/a\\u003e\"],\"HDU-1087\":[\"Super Jumping! Jumping! Jumping!\",24533,\"\"],\"HDU-2973\":[\"YAPTCHA\",1125,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dCentral+European+Programming+Contest+2008\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Central European Programming Contest 2008 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"OpenJ_Bailian-2972\":[\"确定进制\",3230,\"Taejon 2002, POJ 1331, 程序设计实习07\"],\"CodeForces-1043F\":[\"Make It One\",2316,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1043\\\"\\u003eCodeforces Round 519 by Botan Investments\\u003c/a\\u003e\"],\"洛谷-P5020\":[\"货币系统\",28718,\"NOIP2018 提高组\"],\"AtCoder-arc164_b\":[\"Switching Travel\",1418,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc164\\\"\\u003eAtCoder Regular Contest 164\\u003c/a\\u003e\"],\"AtCoder-arc164_c\":[\"Reversible Card Game\",1398,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/arc164\\\"\\u003eAtCoder Regular Contest 164\\u003c/a\\u003e\"],\"洛谷-P8773\":[\"选数异或\",2846,\"蓝桥杯 2022 省 A\"],\"洛谷-P1462\":[\"通往奥格瑞玛的道路\",19499,null],\"洛谷-P5024\":[\"保卫王国\",4810,\"NOIP2018 提高组\"],\"洛谷-P1223\":[\"排队接水\",94931,null],\"洛谷-P3403\":[\"跳楼机\",4902,null],\"OpenJ_Bailian-3253\":[\"集合的划分\",467,\"cs10107 C++ Final Exam\"],\"计蒜客-T2035\":[\"蚯蚓\",81,null],\"计蒜客-T2150\":[\"进制转换\",162,\"[NOIP2000]\"],\"洛谷-P2678\":[\"跳石头\",82764,\"NOIP2015 提高组\"],\"洛谷-P8539\":[\"来自地上的支援\",445,\"Wdoi-2\"],\"洛谷-P1228\":[\"地毯填补问题\",13861,null],\"HDU-2064\":[\"汉诺塔III\",15061,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dRPG%D7%A8%B3%A1%C1%B7%CF%B0%C8%FC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e RPG专场练习赛 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"Gym-104090D\":[\"Money Game\",1752,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/104090\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eThe 2022 ICPC Asia Hangzhou Regional Programming Contest\\u003c/a\\u003e\"],\"洛谷-B3647\":[\"Floyd\",12364,\"模板\"],\"洛谷-P1908\":[\"逆序对\",101434,null],\"LibreOJ-10183\":[\"股票交易\",475,\"一本通 5.5 练习 4\"],\"CodeForces-985D\":[\"Sand Fortress\",2491,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/985\\\"\\u003eEducational Codeforces Round 44 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-888G\":[\"Xor-MST\",4387,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/888\\\"\\u003eEducational Codeforces Round 32\\u003c/a\\u003e\"],\"洛谷-P3092\":[\"No Change G\",4355,\"USACO13NOV\"],\"洛谷-P1471\":[\"方差\",8830,null],\"51Nod-1018\":[\"排序\",4410,\"李陶冶\"],\"洛谷-P1352\":[\"没有上司的舞会\",49830,null],\"洛谷-P8422\":[\"德州消消乐\",191,\"THUPC2022 决赛\"]}","joined":false,"groups":{}},"managingGroups":{},"author":"werio45","updateTime":1693642796000,"title":"ZROI 2023D班题单","dislikeCnt":0,"content":"# ZR 2023 Summer [A](/) / [B](/article/3908) / [C](/article/3852) / [D](/article/3910) Workbook\n## 正睿OI练习题D班大题单\n**极简版......**\n~~未完待续......~~完结了(呜呜呜)\n\n### 7.17 [Day1](/contest/569606) 暴力+模拟\n讲题人:glx\n[problem:洛谷-P2119]\n[problem:CodeForces-1061C]\n[problem:CodeForces-1101D]\n[problem:洛谷-P1328]\n[problem:洛谷-P8422] 选做\n[problem:CodeForces-1848B]\n[problem:CodeForces-1848A]\n### 7.18 [Day2](/contest/569805) 差分/前缀和+递归/递推\n讲题人:xry\n[problem:CodeForces-166E]\n[problem:OpenJ_Bailian-3253]\n[problem:OpenJ_Bailian-4147]\n[problem:51Nod-1081]\n[problem:黑暗爆炸-3043]\n[problem:计蒜客-T1320]\n[problem:计蒜客-T1738]\n[problem:HDU-1207]\n[problem:HDU-2064]\n[problem:HDU-2077]\n[problem:HDU-1995]\n[problem:HDU-6514]\n[problem:HDU-1465]\n[problem:HDU-2563]\n[problem:洛谷-P1096]\n[problem:洛谷-P1040]\n[problem:黑暗爆炸-4563]\n[problem:洛谷-P3223]\n[problem:计蒜客-T2431]\n\n### 7.19 [Day3](/contest/570016) 排序+高精度\n讲题人:xry\n[problem:计蒜客-T1448]\n[problem:洛谷-P1908]\n[problem:51Nod-1018]\n[problem:HDU-1872]\n[problem:计蒜客-T1847]\n[problem:OpenJ_Bailian-2798]\n[problem:Gym-292435A]\n[problem:OpenJ_Bailian-2980]\n[problem:OpenJ_Bailian-2737]\n[problem:OpenJ_Bailian-1220]\n[problem:OpenJ_Bailian-2972]\n[problem:计蒜客-T2150]\n[problem:洛谷-P1966]\n[problem:洛谷-P1517]\n\n### 7.20 [Day4](/contest/570257) 搜索+贪心\n讲题人:xry\n[problem:计蒜客-T1859]\n[problem:计蒜客-T1597]\n[problem:LibreOJ-10019]\n[problem:LibreOJ-10020]\n[problem:LibreOJ-10021]\n[problem:HDU-1401]\n[problem:洛谷-P1223]\n[problem:LibreOJ-2603]\n[problem:LibreOJ-2559]\n[problem:LibreOJ-2248]\n[problem:CodeForces-1003D]\n[problem:AtCoder-arc066_c]\n[problem:AtCoder-agc008_d]\n\n### 7.21 Day5 [D班模拟赛](http://zhengruioi.com/contest/1407)\n出题人:xry\n\n### 7.22 [Day6](/contest/570621) 二分+三分+分治\n讲题人:xry\n[problem:计蒜客-T1555]\n[problem:计蒜客-T1556]\n[problem:OpenJ_Bailian-2774]\n[problem:洛谷-P2678]\n[problem:LibreOJ-10014]\n[problem:计蒜客-T2011]\n[problem:洛谷-P2218]\n[problem:CodeForces-985D]\n[problem:CodeForces-739E]\n[problem:LibreOJ-10013]\n[problem:LibreOJ-10017]\n[problem:洛谷-P1228]\n[problem:CodeForces-1400E]\n[problem:CodeForces-364E]\n[problem:CodeForces-161C]\n\n### 7.23 [Day7](/contest/570810) 高中数学+数论+组合数学基础\n讲题人:xry\n[problem:CodeForces-1674B]\n[problem:CodeForces-1574B]\n[problem:CodeForces-1648A]\n[problem:CodeForces-1777D]\n[problem:HDU-4336]\n[problem:CodeForces-1841F]\n\n### 7.24 [Day8](/contest/570985) 简单DP+背包\n讲题人:xry\n[problem:洛谷-P2871]\n[problem:洛谷-P1616]\n[problem:洛谷-P1776]\n[problem:洛谷-P1833]\n[problem:洛谷-P1757]\n[problem:洛谷-P1064]\n[problem:HDU-1087]\n[problem:HDU-1257]\n[problem:AtCoder-abc273_g]\n[problem:CodeForces-1799G]\n\n**注:后两题讲解在7.25课件后面**\n\n### 7.25 [Day9](/contest/571182) 线性DP\n讲题人:xry\n[problem:洛谷-P1169]\n[problem:洛谷-P1091]\n[problem:LibreOJ-10148]\n[problem:LibreOJ-10149]\n[problem:LibreOJ-10150]\n[problem:LibreOJ-10151]\n[problem:LibreOJ-10152]\n\n### 7.26 Day10 [D班模拟赛](http://zhengruioi.com/contest/1409)\n出题人:xry\n\n### 7.27 [Day11](/contest/571586) STL+链表/队列/栈\n讲题人:xry\n[problem:计蒜客-T1723]\n[problem:洛谷-P4929]\n[problem:UVA-514]\n[problem:计蒜客-T2092]\n[problem:OpenJ_Bailian-2559]\n[problem:洛谷-P1886]\n[problem:LibreOJ-10143]\n[problem:HDU-1263]\n[problem:QOJ-3760]\n[problem:计蒜客-T2035]\n\n### 7.28 Day12 [CD联考欢乐ACM](/contest/570501)\n组题人:xry\n[problem:Gym-100418H]\n[problem:Gym-104090D]\n[problem:Gym-100418A]\n[problem:Gym-100418C]\n[problem:Gym-104160D]\n[problem:Gym-100418D]\n[problem:Gym-103960K]\n[problem:Gym-100418J]\n[problem:Gym-104160L]\n[problem:Gym-103960I]\n\n### 7.29 [Day13](/contest/571951) RMQ+倍增\n讲题人:wzy\n[problem:洛谷-P3865]\n[problem:洛谷-P2251]\n[problem:洛谷-P7809]\n[problem:洛谷-P8773]\n[problem:洛谷-P7244]\n[problem:洛谷-P7974]\n[problem:洛谷-P5648]\n[problem:洛谷-P7167]\n[problem:洛谷-P1081]\n[problem:洛谷-P3379]练习倍增LCA\n[problem:洛谷-P4281]\n[problem:洛谷-P5557]\n[problem:洛谷-P3398]\n[problem:洛谷-P5024]\n\n### 7.30 [Day14](/contest/572135) 树状数组+线段树\n讲题人:wzy\n[problem:洛谷-P3374]\n[problem:洛谷-P1908]\n[problem:洛谷-P3801]\n[problem:洛谷-P7972]\n[problem:洛谷-P1972]\n[problem:洛谷-P5673]\n[problem:洛谷-P2161]\n[problem:洛谷-P3372]\n[problem:洛谷-P3373]\n[problem:洛谷-P4588]\n[problem:洛谷-P1471]\n[problem:洛谷-P8539]\n[problem:洛谷-P5584]\n[problem:洛谷-P2757]\n\n### 7.31 [Day15](/contest/572354) 图论基础\n讲题人:花花(hlt)\n[problem:CodeForces-173B]\n[problem:洛谷-P3304]\n[problem:POJ-1655]\n[problem:洛谷-P1364]\n[problem:洛谷-P3379]练习树剖LCA\n[problem:洛谷-P9304]\n[problem:洛谷-P5536]\n[problem:洛谷-P7775]\n\n### 8.1 Day16 数论基础+[附加赛](http://www.zhengruioi.com/contest/1410)\n讲题人:wzy\n[problem:洛谷-P3811]\n[problem:洛谷-P1495]\n[problem:HDU-2973]\n[problem:洛谷-P1835]\n[problem:洛谷-P3383]\n[problem:CodeForces-1036F]\n[problem:CodeForces-1043F]\n[problem:洛谷-P1390]\n[problem:洛谷-P5656]选做\n\n### 8.2 [Day17](/contest/572794) 最小生成树+堆\n讲题人:wzy\n[problem:洛谷-P3378]\n[problem:洛谷-P1168]\n[problem:洛谷-P1631]\n[problem:洛谷-P2085]\n[problem:洛谷-P2168]\n[problem:洛谷-P1392]\n[problem:洛谷-P2107]\n[problem:洛谷-P1382]\n[problem:洛谷-P3366]\n[problem:洛谷-P2504]\n[problem:洛谷-P2330]\n[problem:洛谷-P2323]\n[problem:洛谷-P1967]\n[problem:洛谷-P9488]\n[problem:CodeForces-888G]\n\n### 8.3 [Day18](/contest/573087) 最短路基础\n讲题人:wzy\n[problem:洛谷-B3647]\n[problem:洛谷-B3611]\n[problem:洛谷-P4779]Dijstra\n[problem:洛谷-P3371]SPFA\n[problem:洛谷-P3385]\n[problem:洛谷-P1144]\n[problem:洛谷-P1462]\n[problem:洛谷-P4568]\n[problem:洛谷-P2505]\n[problem:洛谷-P3350]\n[problem:洛谷-P3953]\n[problem:洛谷-P3403]\n[problem:洛谷-P6175]选做\n\n### 8.4 Day19 [D班模拟赛](https://zhengruioi.com/contest/1412)\n组题人:wzy\n\n### 8.5 [Day20](/contest/573590) 区间DP\n讲题人:hwy\n[problem:洛谷-P4767]\n[problem:洛谷-P1880]\n[problem:洛谷-P1063]\n[problem:洛谷-P1775]\n[problem:CodeForces-794E]\n[problem:LibreOJ-2545]\n[problem:洛谷-P5569] 选做\n\n### 8.6 [Day21](/contest/573762) 状压DP+[附加赛](https://zhengruioi.com/contest/1415)\n讲题人:hwy\n[problem:洛谷-P1896]\n[problem:洛谷-P1433]\n[problem:LibreOJ-10173]\n[problem:洛谷-P2327]\n[problem:洛谷-P3092]\n\n### 8.7 [Day22](/contest/573945) 树状数组进阶\n讲题人:hwy\n[problem:LibreOJ-130]\n[problem:LibreOJ-131]\n[problem:LibreOJ-132]\n[problem:LibreOJ-133]\n[problem:LibreOJ-134]\n[problem:LibreOJ-135]\n[problem:洛谷-P3810]\n[problem:洛谷-P6186]\n[problem:LibreOJ-3299]\n\n### 8.8 [Day23](/contest/574178) 线段树进阶\n讲题人:hwy\n[problem:CodeForces-438D]\n[problem:HDU-5828]\n[problem:洛谷-P2221]\n[problem:黑暗爆炸-2124]\n[problem:CodeForces-280D]\n附:[AcWing246](https://www.acwing.com/problem/content/247/) 牛客949H另版 区间加+区间gcd\n\n### 8.9 Day24 [ABCD ACM联考](/contest/573830)\n[problem:Gym-104053E]\n[problem:Gym-104053H]\n[problem:Gym-104053L]\n[problem:CodeForces-1394C]\n[problem:Gym-103640K]\n[problem:Gym-103648K]\n[problem:Gym-103640F]\n[problem:CodeForces-1303G]\n[problem:Gym-102978F]\n[problem:CodeForces-1333E]\n[problem:Gym-102978I]\n[problem:Gym-104460L]\n\n### 8.10 [Day25](/contest/574692) 最短路进阶(再放送)\n讲题人:hwy\n[problem:洛谷-P5960]\n[problem:洛谷-P1983]\n[problem:洛谷-P4568]再放送\n[problem:洛谷-P3350]再放送\n[problem:洛谷-P3953]再放送\n[problem:洛谷-P2505]再放送\n[problem:洛谷-P1491]再放送\n\n### 8.11 [Day26](/contest/574917) 树形DP\n讲题人:hlt\n[problem:洛谷-P2014]\n[problem:洛谷-P1352]\n[problem:洛谷-P2015]\n[problem:洛谷-P3174]\n[problem:洛谷-P3596]\n[problem:CodeForces-1779E]\n[problem:UVA-11174]拓扑序计数\n\n### 8.12 [Day27](/contest/575047)字符串+[附加赛](https://zhengruioi.com/1423)\nhash+trie+kmp\n讲题人:hlt\n[problem:洛谷-P3370]\n[problem:CodeForces-1200E]\n[problem:洛谷-P3375]\n[problem:CodeForces-471D]\n[problem:UVA-12467]\n[problem:洛谷-P2580]\n[problem:洛谷-P4551]\n\n### 8.13 [Day28](/contest/575184) DP优化\n讲题人:hlt\n[problem:洛谷-P1886]\n[problem:洛谷-P1776]\n[problem:洛谷-P5020]\n[problem:CodeForces-373E]\n[problem:LibreOJ-10183]\n[problem:洛谷-P2657]\n\n### 8.14 Day29 杂题选讲\n讲题人:上午dcx 下午dyh(怎么放飞自我了啊)(恼)\n上午:\n[problem:AtCoder-arc066_c]\n[problem:AtCoder-agc008_d]\n[problem:CodeForces-954I]\n[problem:黑暗爆炸-4699]\n[problem:AtCoder-arc073_d]\n[problem:CodeForces-283E]\n[problem:LibreOJ-3291]\n[problem:CodeForces-983D]\n[problem:LibreOJ-3128]\n[problem:Gym-102832L]\n[problem:CodeForces-798D]\n[problem:黑暗爆炸-4221]课件里是加强版,采用$n^2$的做法\n114个题找不到(发怒)\n下午:(agc\u0026arc选讲)\n[problem:AtCoder-agc064_b]\n[problem:AtCoder-agc063_c]\n[problem:AtCoder-arc164_b]\n[problem:AtCoder-arc164_c]\n[problem:AtCoder-arc162_b]\n[problem:AtCoder-arc162_c]\n[problem:AtCoder-arc161_c]\n[problem:AtCoder-agc062_b]\n[problem:AtCoder-agc062_c]\n[problem:AtCoder-arc160_b]\n[problem:AtCoder-arc160_c]\n[problem:AtCoder-arc159_b]\n[problem:AtCoder-arc159_c]\n[problem:AtCoder-arc159_d]\n有些题在课件里但没讲过\n\n### 8.15 Day30 [CD联考——送你上路](http://www.zhengruioi.com/contest/1428)\n讲题人:hlt","threadId":152645,"likeCnt":7,"createTime":1690725267000,"isWorkbook":true,"viewCnt":2442,"openness":2,"fav":false,"id":3910,"trustable":false}