Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"POJ-1276\":[\"Cash Machine\",12383,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dSoutheastern+Europe+2002\\\"\\u003eSoutheastern Europe 2002\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3245\":[\"Sequence Partitioning\",234,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2007.07.08\\\"\\u003ePOJ Monthly--2007.07.08\\u003c/a\\u003e, Chen, Danqi\\u003c/div\\u003e\"],\"POJ-3410\":[\"Split convex polygon\",138,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNortheastern+Europe+2002\\\"\\u003eNortheastern Europe 2002\\u003c/a\\u003e, Western Subregion\\u003c/div\\u003e\"],\"HDU-3415\":[\"Max Sum of Max-K-sub-sequence\",2796,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDOJ+Monthly+Contest+%A8C+2010.06.05\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDOJ Monthly Contest – 2010.06.05 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-3017\":[\"Cut the Sequence\",2497,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2006.09.29\\\"\\u003ePOJ Monthly--2006.09.29\\u003c/a\\u003e, zhucheng\\u003c/div\\u003e\"],\"HDU-3530\":[\"Subsequence\",2630,\"\\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%A810%A3%A9%A1%AA%A1%AAHost+by+HEU\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 ACM-ICPC Multi-University Training Contest(10)——Host by HEU \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-1821\":[\"Fence\",2022,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dRomania+OI+2002\\\"\\u003eRomania OI 2002\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-4374\":[\"One hundred layer\",663,\"\\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+8\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2012 Multi-University Training Contest 8 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-2823\":[\"Sliding Window\",15428,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2006.04.28\\\"\\u003ePOJ Monthly--2006.04.28\\u003c/a\\u003e, Ikki\\u003c/div\\u003e\"],\"HDU-3401\":[\"Trade\",1353,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDOJ+Monthly+Contest+%A8C+2010.05.01\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDOJ Monthly Contest – 2010.05.01 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-3926\":[\"Parade\",253,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dBeijing+2008\\\"\\u003eBeijing 2008\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-2191\":[\"悼念512汶川大地震遇难同胞——珍惜现在,感恩生活\",14107,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2008-06-18%A1%B6+ACM%B3%CC%D0%F2%C9%E8%BC%C6%A1%B7%C6%DA%C4%A9%BF%BC%CA%D4%A1%AA%A1%AA%CB%C4%B4%A8%BC%D3%D3%CD%A3%A1%D6%D0%B9%FA%BC%D3%D3%CD%A3%A1\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2008-06-18《 ACM程序设计》期末考试——四川加油!中国加油! \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4362\":[\"Dragon Ball\",652,\"\\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+7\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2012 Multi-University Training Contest 7 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-2373\":[\"Dividing the Path\",1531,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2004+December+Gold\\\"\\u003eUSACO 2004 December Gold\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3162\":[\"Walking Race\",857,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2006.12.31\\\"\\u003ePOJ Monthly--2006.12.31\\u003c/a\\u003e, flymouse\\u003c/div\\u003e\"]}","joined":false,"groups":{}},"managingGroups":{},"author":"QUST1808110112","updateTime":1601793462000,"title":"动态规划之单调队列优化","dislikeCnt":0,"content":"Problem A\tCash Machine[problem:POJ-1276]\nProblem B\tCoins[problem:POJ-742]\nProblem C\tFence[problem:POJ-1821]\nProblem D\tDividing the Path[problem:POJ-2373]\nProblem E\tParade[problem:POJ-3926]\nProblem F\tSliding Window[problem:POJ-2823]\nProblem G\tCut the Sequence[problem:POJ-3017]\nProblem H\tSequence Partitioning[problem:POJ-3245]\nProblem I\tPassing the Message[problem:POJ-3410]\nProblem J\tWalking Race[problem:POJ-3162]\nProblem K\t悼念512汶川大地震遇难同胞——珍惜现在,感恩生活[problem:HDU-2191]\nProblem L\tSubsequence[problem:HDU-3530]\nProblem M\tMax Sum of Max-K-sub-sequence[problem:HDU-3415]\nProblem N\tTrade[problem:HDU-3401]\nProblem O\tOne hundred layer[problem:HDU-4374]\nProblem P\tDragon Ball[problem:HDU-4362]\nProblem Q\tRobotruck[problem:UVALive 3983]\n","threadId":48330,"likeCnt":4,"createTime":1559529484000,"isWorkbook":true,"viewCnt":2745,"openness":2,"fav":false,"id":1143,"trustable":false}