{"workbook":{"problemsBrief":"{\"CodeForces-245H\":[\"Queries for Number of Palindromes\",11384,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/245\\\"\\u003eCROC-MBTU 2012, Elimination Round (ACM-ICPC)\\u003c/a\\u003e\"],\"CodeForces-1009F\":[\"Dominant Indices\",9057,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1009\\\"\\u003eEducational Codeforces Round 47 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-16E\":[\"Fish\",6863,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/16\\\"\\u003eCodeforces Beta Round 16 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-366C\":[\"Dima and Salad\",7488,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/366\\\"\\u003eCodeforces Round 214 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1025D\":[\"Recovering BST\",4349,\"\\u003ca 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-1312G\":[\"Autocompletion\",1069,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1312\\\"\\u003eEducational Codeforces Round 83 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-455A\":[\"Boredom\",79598,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/455\\\"\\u003eCodeforces Round 260 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1110D\":[\"Jongmah\",4395,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1110\\\"\\u003eCodeforces Global Round 1\\u003c/a\\u003e\"],\"CodeForces-1312E\":[\"Array Shrinking\",8564,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1312\\\"\\u003eEducational Codeforces Round 83 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1324F\":[\"Maximum White Subtree\",14243,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1324\\\"\\u003eCodeforces Round 627 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1097G\":[\"Vladislav and a Great Legend\",1059,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1097\\\"\\u003eHello 2019\\u003c/a\\u003e\"],\"CodeForces-1061C\":[\"Multiplicity\",11646,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1061\\\"\\u003eCodeforces Round 523 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-855B\":[\"Marvolo Gaunt\\u0027s Ring\",11039,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/855\\\"\\u003eManthan, Codefest 17\\u003c/a\\u003e\"],\"CodeForces-613D\":[\"Kingdom and its Cities\",4723,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/613\\\"\\u003eCodeforces Round 339 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-835F\":[\"Roads in the Kingdom\",1324,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/835\\\"\\u003eCodeforces Round 427 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-673E\":[\"Levels and Regions\",163,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/673\\\"\\u003eCodeforces Round 351 (VK Cup 2016 Round 3, Div. 2 Edition)\\u003c/a\\u003e\"],\"CodeForces-592D\":[\"Super M\",3149,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/592\\\"\\u003eCodeforces Round 328 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-580D\":[\"Kefa and Dishes\",14310,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/580\\\"\\u003eCodeforces Round 321 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-321E\":[\"Ciel and Gondolas\",7041,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/321\\\"\\u003eCodeforces Round 190 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-212E\":[\"IT Restaurants\",2617,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/212\\\"\\u003eVK Cup 2012 Finals (unofficial online-version)\\u003c/a\\u003e\"],\"CodeForces-204A\":[\"Little Elephant and Interval\",7443,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/204\\\"\\u003eCodeforces Round 129 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1153D\":[\"Serval and Rooted Tree\",6136,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1153\\\"\\u003eCodeforces Round 551 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-815C\":[\"Karen and Supermarket\",3658,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/815\\\"\\u003eCodeforces Round 419 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-507D\":[\"The Maths Lecture\",2198,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/507\\\"\\u003eCodeforces Round 287 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-628D\":[\"Magic Numbers\",9346,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/628\\\"\\u003eEducational Codeforces Round 8\\u003c/a\\u003e\"],\"CodeForces-1092F\":[\"Tree with Maximum Cost\",10832,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1092\\\"\\u003eCodeforces Round 527 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1060E\":[\"Sergey and Subway\",3893,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1060\\\"\\u003eCodeforces Round 513 by Barcelona Bootcamp (rated, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-797F\":[\"Mice and Holes\",1690,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/797\\\"\\u003eEducational Codeforces Round 19\\u003c/a\\u003e\"],\"CodeForces-191A\":[\"Dynasty Puzzles\",5465,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/191\\\"\\u003eCodeforces Round 121 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-660F\":[\"Bear and Bowling 4\",2420,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/660\\\"\\u003eEducational Codeforces Round 11\\u003c/a\\u003e\"],\"CodeForces-372C\":[\"Watching Fireworks is Fun\",996,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/372\\\"\\u003eCodeforces Round 219 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-320E\":[\"Kalila and Dimna in the Logging Industry\",31,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/320\\\"\\u003eCodeforces Round 189 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1156D\":[\"0-1-Tree\",4930,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1156\\\"\\u003eEducational Codeforces Round 64 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-118D\":[\"Caesar\\u0027s Legions\",22650,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/118\\\"\\u003eCodeforces Beta Round 89 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1132F\":[\"Clear the String\",11586,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1132\\\"\\u003eEducational Codeforces Round 61 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-939F\":[\"Cutlet\",1282,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/939\\\"\\u003eCodeforces Round 464 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1120D\":[\"Power Tree\",1948,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1120\\\"\\u003eCodeforces Round 543 (Div. 1, based on Technocup 2019 Final Round)\\u003c/a\\u003e\"],\"CodeForces-1499F\":[\"Diameter Cuts\",1664,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1499\\\"\\u003eEducational Codeforces Round 106 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-833B\":[\"The Bakery\",7079,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/833\\\"\\u003eCodeforces Round 426 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1140D\":[\"Minimum Triangulation\",14304,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1140\\\"\\u003eEducational Codeforces Round 62 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-986E\":[\"Prince\\u0027s Problem\",947,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/986\\\"\\u003eCodeforces Round 485 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-788C\":[\"The Great Mixing\",2977,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/788\\\"\\u003eCodeforces Round 407 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-922E\":[\"Birds\",2938,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/922\\\"\\u003eCodeforces Round 461 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-631E\":[\"Product Sum\",3359,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/631\\\"\\u003eCodeforces Round 344 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-11D\":[\"A Simple Task\",7839,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/11\\\"\\u003eCodeforces Beta Round 11\\u003c/a\\u003e\"],\"CodeForces-55D\":[\"Beautiful numbers\",7497,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/55\\\"\\u003eCodeforces Beta Round 51\\u003c/a\\u003e\"],\"CodeForces-351E\":[\"Jeff and Permutation\",1972,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/351\\\"\\u003eCodeforces Round 204 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-15D\":[\"Map\",976,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/15\\\"\\u003eCodeforces Beta Round 15\\u003c/a\\u003e\"],\"CodeForces-149D\":[\"Coloring Brackets\",6249,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/149\\\"\\u003eCodeforces Round 106 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-311B\":[\"Cats Transport\",5004,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/311\\\"\\u003eCodeforces Round 185 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1143B\":[\"Nirvana\",12298,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1143\\\"\\u003eCodeforces Round 549 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-189A\":[\"Cut Ribbon\",91362,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/189\\\"\\u003eCodeforces Round 119 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1179D\":[\"Fedor Runs for President\",1096,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1179\\\"\\u003eCodeforces Round 569 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-607B\":[\"Zuma\",19723,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/607\\\"\\u003eCodeforces Round 336 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-708C\":[\"Centroids\",4772,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/708\\\"\\u003eAIM Tech Round 3 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-914C\":[\"Travelling Salesman and Special Numbers\",4831,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/914\\\"\\u003eCodecraft-18 and Codeforces Round 458 (Div. 1 + Div. 2, combined)\\u003c/a\\u003e\"],\"CodeForces-1155F\":[\"Delivery Oligopoly\",558,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1155\\\"\\u003eEducational Codeforces Round 63 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1187E\":[\"Tree Painting\",12403,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1187\\\"\\u003eEducational Codeforces Round 67 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1111E\":[\"Tree\",1124,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1111\\\"\\u003eCodeCraft-19 and Codeforces Round 537 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1304F2\":[\"Animal Observation (hard version)\",1891,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1304\\\"\\u003eCodeforces Round 620 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1454E\":[\"Number of Simple Paths\",6769,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1454\\\"\\u003eCodeforces Round 686 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1280D\":[\"Miss Punyverse\",1325,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1280\\\"\\u003eCodeforces Round 607 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-816E\":[\"Karen and Supermarket\",118,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/816\\\"\\u003eCodeforces Round 419 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-505D\":[\"Mr. Kitayuta\\u0027s Technology\",3028,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/505\\\"\\u003eCodeforces Round 286 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-735E\":[\"Ostap and Tree\",1097,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/735\\\"\\u003eCodeforces Round 382 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-868F\":[\"Yet Another Minimization Problem\",5500,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/868\\\"\\u003eCodeforces Round 438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined)\\u003c/a\\u003e\"],\"CodeForces-888F\":[\"Connecting Vertices\",1150,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/888\\\"\\u003eEducational Codeforces Round 32\\u003c/a\\u003e\"],\"CodeForces-791D\":[\"Bear and Tree Jumps\",136,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/791\\\"\\u003eCodeforces Round 405 (rated, Div. 2, based on VK Cup 2017 Round 1)\\u003c/a\\u003e\"],\"CodeForces-71E\":[\"Nuclear Fusion\",952,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/71\\\"\\u003eCodeforces Beta Round 65 (Div. 2)\\u003c/a\\u003e\"]}","joined":false,"groups":{}},"managingGroups":{},"collectingGroups":[[13222,"exercises","PU Programming Exercises","https://cn.cravatar.com/avatar/3daf10e04392235936a5443269ed52a0?d\u003dwavatar",true],[15910,"smuxcpc","SMU-XCPC","https://cdn.vjudge.net.cn/group/logo/15910?v\u003d1677587906",true],[21527,"xmyz2022","厦门一中2022级","https://cn.cravatar.com/avatar/7f2ed0228e21d69971c1558aa4a7de83?d\u003didenticon",true],[21540,"suanfa2024","俱乐部算法训练","https://cdn.vjudge.net.cn/group/logo/21540?v\u003d1717410387",true],[23874,"lynu24ACM","24级ACM实验室","https://cdn.vjudge.net.cn/group/logo/23874?v\u003d1728907893",true],[24900,"wannabe","Acc.","https://cdn.vjudge.net.cn/group/logo/24900?v\u003d1733819637",true],[27710,"tyhm","tonyhome","https://cn.cravatar.com/avatar/28f98269ca1306b8a6170d237fe1f73e?d\u003didenticon",true],[17755,"hdfz","hdfz","https://cn.cravatar.com/avatar/144f4b56082a2cb897e7bc38ad09727c?d\u003drobohash",true],[15677,"fosuacm","FOSU ACM","https://cdn.vjudge.net.cn/group/logo/15677?v\u003d1675428578",true],[32587,"problemsBadOmenX","Good题单","https://cn.cravatar.com/avatar/6d5231639b2380f99c1091aad61d405d?d\u003dretro",true],[13119,"wuwuwu","而我只能在一旁看烟火","https://cn.cravatar.com/avatar/f94dbfb05469e7badf28d60dfb22e1cd?d\u003didenticon",false],[13191,"goxcpc","菜狗冲锋xcpc","https://cn.cravatar.com/avatar/e3eb2ab18ab760305a1fe7392b587a72?d\u003dwavatar",false],[16954,"ycoi","zjyc2023","https://cn.cravatar.com/avatar/05bdf65af390b164c701ca2aab373658?d\u003dretro",false],[17277,"code_revengers","Topicwise Marathons","https://cn.cravatar.com/avatar/9d41b080f2d89de9d7f2ede8e4e2b5e7?d\u003dretro",false],[17793,"not-ok","云顶之弈（acm版）","https://cdn.vjudge.net.cn/group/logo/17793?v\u003d1693298556",false],[18689,"opteam","爱玩原神的VJ刷题题单","https://cn.cravatar.com/avatar/dcea691c2695eca4025620f632aac828?d\u003drobohash",false],[19179,"train29","Training?","https://cdn.vjudge.net.cn/group/logo/19179?v\u003d1701281917",false],[24125,"hiip","HumanInstrumentalityProject","https://cdn.vjudge.net.cn/group/logo/24125?v\u003d1729914133",false],[27457,"not_quite","Not Quite","https://cdn.vjudge.net.cn/group/logo/27457?v\u003d1748719302",false],[29107,"hnuitacm","自由编程协会","https://cdn.vjudge.net.cn/group/logo/29107?v\u003d1755846651",false],[23270,"algorithm_acm","算法启航小分队","https://cn.cravatar.com/avatar/9fe1b1978f34e97f848b19b4968e5b74?d\u003dmonsterid",false],[7863,"zmf","#include \u003cacm.medals\u003e","https://cdn.vjudge.net.cn/group/logo/7863?v\u003d1593079526",false]],"author":"GDUT20ZYL","updateTime":1618499400000,"title":"Codeforces DP细化分类专题","dislikeCnt":4,"content":"1.1 线性dp\n\t[problem:CodeForces-191A]\n\t[problem:CodeForces-455A]\n\t[problem:CodeForces-1061C]\n\t[problem:CodeForces-1110D]\n\t[problem:CodeForces-1312E]\n\t[problem:CodeForces-245H]\n\t1.2 背包问题\n\t[problem:CodeForces-189A]\n\t[problem:CodeForces-855B]\n\t[problem:CodeForces-366C]\n\t[problem:CodeForces-788C]\n\t[problem:CodeForces-118D]\n\t[problem:CodeForces-922E]\n\t1.3 区间DP\n\t[problem:CodeForces-607B]\n\t[problem:CodeForces-149D]\n\t[problem:CodeForces-1025D]\n\t[problem:CodeForces-1140D]\n\t[problem:CodeForces-149D]\n\t[problem:CodeForces-1312E]\n\t[problem:CodeForces-888F]\n\t[problem:CodeForces-1132F]\n\t1.4 状压DP\n[problem:CodeForces-580D]\n[problem:CodeForces-505D]\n[problem:CodeForces-410D]\n[problem:CodeForces-11D]\n[problem:CodeForces-16E]\n[problem:CodeForces-71E]\n[problem:CodeForces-1155F]\n\t1.5 数位DP\n[problem:CodeForces-204A]\n[problem:CodeForces-1143B]\n[problem:CodeForces-914C]\n[problem:CodeForces-55D]\n[problem:CodeForces-628D]\n[problem:CodeForces-507D]\n\t1.6 树形DP\n[problem:CodeForces-791D]\n[problem:CodeForces-1120D]\n[problem:CodeForces-1153D]\n[problem:CodeForces-735E]\n[problem:CodeForces-1060E]\n\t1.7 树上背包\n[problem:CodeForces-815C]\n[problem:CodeForces-1280D]\n[problem:CodeForces-212E]\n[problem:CodeForces-816E]\n[problem:CodeForces-1097G]\n\t1.8 换根dp\n[problem:CodeForces-708C]\n[problem:CodeForces-1156D]\n[problem:CodeForces-1092F]\n[problem:CodeForces-1187E]\n[problem:CodeForces-1324F]\n\t1.9 基环树DP\n[problem:CodeForces-1454E]\n[problem:CodeForces-835F] \n1.10 虚树\n[problem:CodeForces-613D]\n[problem:CodeForces-592D]\n[problem:CodeForces-986E]\n[problem:CodeForces-1111E]\n[problem:CodeForces-1097G]\n1.11 树链剖分优化DP\n(有些可以dsu on tree)\n[problem:CodeForces-1009F]\n[problem:CodeForces-1499F]\n[problem:CodeForces-1312G]\n1.12 单调队列优化DP\n[problem:CodeForces-372C]\n[problem:CodeForces-15D]\n[problem:CodeForces-797F]\n[problem:CodeForces-939F]\n[problem:CodeForces-1304F2]\n1.13 决策单调性优化DP\n[problem:CodeForces-833B]\n[problem:CodeForces-320E]\n[problem:CodeForces-321E]\n[problem:CodeForces-868F]\n1.14 斜率优化DP\n[problem:CodeForces-311B]\n[problem:CodeForces-1179D]\n[problem:CodeForces-351E]\n[problem:CodeForces-673E]\n[problem:CodeForces-631E]\n[problem:CodeForces-660F]","threadId":97692,"likeCnt":170,"createTime":1618486071000,"isWorkbook":true,"viewCnt":32639,"openness":2,"fav":false,"id":2605,"trustable":false}
