Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"HDU-4714\":[\"Tree2cycle\",865,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2013+ACM%2FICPC+Asia+Regional+Online+%A1%AA%A1%AA+Warmup\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013 ACM/ICPC Asia Regional Online —— Warmup \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4616\":[\"Game\",595,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2013+Multi-University+Training+Contest+2\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013 Multi-University Training Contest 2 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HYSBZ-4247\":[\"挂饰\",97,\"\\u003cp\\u003e\\u003ca href\\u003d\\\"http://www.lydsy.com/JudgeOnline/problemset.php?search\\u003dJOI 2013~2014 春季training合宿 竞技4 By PoPoQQQ\\\"\\u003eJOI 2013~2014 春季training合宿 竞技4 By PoPoQQQ\\u003c/a\\u003e\\u003c/p\\u003e\"],\"HDU-4514\":[\"湫湫系列故事——设计风景线\",1000,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2013%CC%DA%D1%B6%B1%E0%B3%CC%C2%ED%C0%AD%CB%C9%B3%F5%C8%FC%B5%DA%B6%FE%B3%A1%A3%A83%D4%C222%C8%D5%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013腾讯编程马拉松初赛第二场(3月22日) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4734\":[\"F(x)\",4113,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2013+ACM%2FICPC+Asia+Regional+Chengdu+Online\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013 ACM/ICPC Asia Regional Chengdu Online \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4756\":[\"Install Air Conditioning\",387,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2013+ACM%2FICPC+Asia+Regional+Nanjing+Online\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013 ACM/ICPC Asia Regional Nanjing Online \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-12563\":[\"Jin Ge Jin Qu hao\",4055,null],\"POJ-1742\":[\"Coins\",10406,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dLouTiancheng%40POJ\\\"\\u003eLouTiancheng@POJ\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVA-1347\":[\"Tour\",3370,null],\"HDU-4398\":[\"Template Library Management\",248,\"\\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+10\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2012 Multi-University Training Contest 10 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4352\":[\"XHXJ\\u0027s LIS\",2014,\"\\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+6\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2012 Multi-University Training Contest 6 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-2955\":[\"Brackets\",8654,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dStanford+Local+2004\\\"\\u003eStanford Local 2004\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-2476\":[\"String painter\",3762,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2008+Asia+Regional+Chengdu\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2008 Asia Regional Chengdu \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-1625\":[\"Color Length\",1709,null],\"HDU-3565\":[\"Bi-peak Number\",282,\"\\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%A813%A3%A9%A1%AA%A1%AAHost+by+UESTC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 ACM-ICPC Multi-University Training Contest(13)——Host by UESTC \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-437\":[\"The Tower of Babylon\",9000,null],\"ZOJ-3537\":[\"Cake\",1577,null],\"ZOJ-1276\":[\"Optimal Array Multiplication Sequence\",971,null],\"UVA-1025\":[\"A Spy in the Metro\",4323,null],\"UVA-11400\":[\"Lighting System Design\",2938,null],\"UVA-11584\":[\"Partitioning by Palindromes\",5320,null],\"HDU-4745\":[\"Two Rabbits\",1669,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2013+ACM%2FICPC+Asia+Regional+Hangzhou+Online\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013 ACM/ICPC Asia Regional Hangzhou Online \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4123\":[\"Bob’s Race\",869,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2011+Asia+Fuzhou+Regional+Contest+\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2011 Asia Fuzhou Regional Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-149D\":[\"Coloring Brackets\",4940,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/149\\\"\\u003eCodeforces Round 106 (Div. 2)\\u003c/a\\u003e\"],\"HDU-2089\":[\"不要62\",26533,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%D3%AD%BD%D3%D0%C2%D1%A7%C6%DA%A1%AA%A1%AA%B3%AC%BC%B6Easy%B0%E6%C8%C8%C9%ED%C8%FC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 迎接新学期——超级Easy版热身赛 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3693\":[\"Math teacher\\u0027s homework\",205,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2010+Asia+Fuzhou+Regional+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 Asia Fuzhou Regional Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-2229\":[\"Sumsets\",8993,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2005+January+Silver\\\"\\u003eUSACO 2005 January Silver\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-1114\":[\"Piggy-Bank\",18599,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dCentral+Europe+1999\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Central Europe 1999 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4126\":[\"Genghis Khan the Conqueror\",717,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2011+Asia+Fuzhou+Regional+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2011 Asia Fuzhou Regional Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4283\":[\"You Are the One\",3611,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2012+ACM%2FICPC+Asia+Regional+Tianjin+Online\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2012 ACM/ICPC Asia Regional Tianjin Online \\u003c/a\\u003e \\u003c/div\\u003e\"],\"ZOJ-3541\":[\"The Last Puzzle\",881,null],\"HDU-3709\":[\"Balanced Number\",3634,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2010+Asia+Chengdu+Regional+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 Asia Chengdu Regional Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-1141\":[\"Brackets Sequence\",7331,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNortheastern+Europe+2001\\\"\\u003eNortheastern Europe 2001\\u003c/a\\u003e\\u003c/div\\u003e\"]}","joined":false,"groups":{}},"managingGroups":{},"author":"hyacinthLJP","updateTime":1563790024000,"title":"动态规划","dislikeCnt":0,"content":"[参考资料]\n[dd大牛的《背包九讲》](https://www.cnblogs.com/jbelial/articles/2116074.html)\n\n基础\n[problem:UVA-1025] [here](https://www.cnblogs.com/violet-acmer/p/10939518.html) [背包]\n[problem:UVA-12563] [here](https://www.cnblogs.com/violet-acmer/p/10961558.html) [01背包]\n[problem:HYSBZ-4247] [here](https://www.cnblogs.com/violet-acmer/p/11205582.html) [01背包]\n[problem:HDU-1114] [here](https://www.cnblogs.com/violet-acmer/p/9890254.html) [完全背包]\n[problem:POJ-1742] [here](https://www.cnblogs.com/violet-acmer/p/9909246.html) [多重背包]\n[problem:UVA-437] [here](https://www.cnblogs.com/violet-acmer/p/10946003.html) [DAG上的动态规划]\n[problem:UVA-1347] [here](https://www.cnblogs.com/violet-acmer/p/10951671.html) [经典DP]\n[problem:UVA-11400] [here](https://www.cnblogs.com/violet-acmer/p/10978390.html#unsolved) [与区间DP相仿]\n[[洛谷 P1140 相似基因]](https://www.luogu.org/problemnew/show/P1140) [here](https://www.cnblogs.com/violet-acmer/p/9878937.html) [与区间DP相仿]\n[problem:UVA-11584] [here](https://www.cnblogs.com/violet-acmer/p/11001763.html) [DP+Manacher]\n[problem:UVA-1625] [here](https://www.cnblogs.com/violet-acmer/p/11010582.html) [基础DP]\n[problem:Codeforces-4D] [here](https://www.cnblogs.com/violet-acmer/p/10951873.html) [LIS]\n[[洛谷1020导弹拦截]](https://www.luogu.org/problemnew/show/P1020) [here](https://www.cnblogs.com/violet-acmer/p/9852550.htmll) [LIS]\n[problem:POJ-2229] [here](https://www.cnblogs.com/violet-acmer/p/9931448.html) [类似于n的m划分]\n\n\n树形DP\n[[2019计蒜之道初赛第一场B]](https://nanti.jisuanke.com/t/39261) [here](https://www.cnblogs.com/violet-acmer/p/10924210.html)\n[problem:Codeforces-1173D] [here](https://www.cnblogs.com/violet-acmer/p/10991346.html)\n[problem:HDU-4123]\n[problem:HDU-4514]\n[problem:HDU-4714]\n[problem:HDU-4616]\n[problem:HDU-4126]\n[problem:HDU-4756]\n\n区间DP\n[problem:ZOJ-1276] [here](https://www.cnblogs.com/violet-acmer/p/11020912.html) [最优矩阵链乘问题]\n[problem:POJ-1141]\n[problem:POJ-2955]\n[problem:HDU-4745]\n[problem:HDU-4283]\n[problem:HDU-2476]\n[problem:ZOJ-3541]\n[problem:ZOJ-3537]\n[problem:CodeForces-149D]\n\n数位DP\n[problem:HDU-2089]\n[problem:HDU-3709]\n[problem:HDU-4398]\n[problem:HDU-4734]\n[problem:HDU-3693]\n[problem:HDU-4352]\n[problem:HDU-3565]\n[problem:CodeForces - 401D]\n[problem:CodeForces - 55D]\n[problem:CodeForces - 258B]\n\n","threadId":48042,"likeCnt":5,"createTime":1558738648000,"isWorkbook":true,"viewCnt":1336,"openness":1,"fav":false,"id":1134,"trustable":false}