Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"HDU-3966\":[\"Aragorn\\u0027s Story\",3384,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2011+Multi-University+Training+Contest+13+-+Host+by+HIT+\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2011 Multi-University Training Contest 13 - Host by HIT \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4417\":[\"Super Mario\",3668,\"\\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+Hangzhou+Online\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2012 ACM/ICPC Asia Regional Hangzhou Online \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HYSBZ-2049\":[\"Cave 洞穴勘测\",423,\"Sdoi2008\"],\"HYSBZ-2286\":[\"消耗战\",212,\"Sdoi2011\"],\"HYSBZ-5312\":[\"冒险\",12,\"\\u003cp\\u003e\\u003ca href\\u003d\\\"http://www.lydsy.com/JudgeOnline/problemset.php?search\\u003dBy佚名上传\\\"\\u003eBy佚名上传\\u003c/a\\u003e\\u003c/p\\u003e\"],\"HDU-1823\":[\"Luck and Love\",1347,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDOJ+2007+Summer+Exercise%A3%A83%A3%A9-+Hold+by+Wiskey\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDOJ 2007 Summer Exercise(3)- Hold by Wiskey \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-11297\":[\"Census\",1556,null],\"SPOJ-COT2\":[\"Count on a tree II\",3696,\"Just for fun...\"],\"POJ-3468\":[\"A Simple Problem with Integers\",29965,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2007.11.25\\\"\\u003ePOJ Monthly--2007.11.25\\u003c/a\\u003e, Yang Yi\\u003c/div\\u003e\"],\"HDU-3726\":[\"Graph and Queries\",573,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2010+Asia+Tianjin+Regional+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 Asia Tianjin Regional Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4419\":[\"Colourful Rectangle\",501,\"\\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+Hangzhou+Online\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2012 ACM/ICPC Asia Regional Hangzhou Online \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3727\":[\"Jewel\",397,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2010+Asia+Tianjin+Regional+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 Asia Tianjin Regional Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-5862\":[\"Counting Intersections\",419,\"\\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+10\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2016 Multi-University Training Contest 10 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-6278\":[\"Just $h$-index\",782,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dCCPC2018-%BA%FE%C4%CF%C8%AB%B9%FA%D1%FB%C7%EB%C8%FC-%D6%D8%CF%D6%C8%FC%A3%A8%B8%D0%D0%BB%CF%E6%CC%B6%B4%F3%D1%A7%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e CCPC2018-湖南全国邀请赛-重现赛(感谢湘潭大学) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-3109\":[\"Inner Vertices\",670,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNortheastern+Europe+2005\\\"\\u003eNortheastern Europe 2005\\u003c/a\\u003e, Northern Subregion\\u003c/div\\u003e\"],\"HDU-2475\":[\"Box\",617,\"\\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\"],\"HDU-1540\":[\"Tunnel Warfare\",5829,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dPOJ+Monthly\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e POJ Monthly \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HYSBZ-3932\":[\"任务查询系统\",200,\"CQOI2015\"],\"HDU-1542\":[\"Atlantis\",6193,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dMid-Central+European+Regional+Contest+2000\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Mid-Central European Regional Contest 2000 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HYSBZ-1878\":[\"HH的项链\",532,\"SDOI2009\"],\"ZOJ-1610\":[\"Count the Colors\",13032,null],\"CodeForces-617E\":[\"XOR and Favorite Number\",8962,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/617\\\"\\u003eCodeforces Round 340 (Div. 2)\\u003c/a\\u003e\"],\"HDU-4010\":[\"Query on The Trees\",1045,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dThe+36th+ACM%2FICPC+Asia+Regional+Dalian+Site+%A1%AA%A1%AA+Online+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e The 36th ACM/ICPC Asia Regional Dalian Site —— Online Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVALive-7141\":[\"BombX\",100,\"Regionals 2014 \\u003e\\u003e Asia - Shanghai\"],\"CodeForces-500E\":[\"New Year Domino\",1516,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/500\\\"\\u003eGood Bye 2014\\u003c/a\\u003e\"],\"POJ-3470\":[\"Walls\",283,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2007.11.25\\\"\\u003ePOJ Monthly--2007.11.25\\u003c/a\\u003e, Zhou Dong\\u003c/div\\u003e\"],\"POJ-1177\":[\"Picture\",5091,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dIOI+1998\\\"\\u003eIOI 1998\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HYSBZ-3489\":[\"maxsum\",60,\"\"],\"HDU-5517\":[\"Triple\",466,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2015ACM%2FICPC%D1%C7%D6%DE%C7%F8%C9%F2%D1%F4%D5%BE-%D6%D8%CF%D6%C8%FC%A3%A8%B8%D0%D0%BB%B6%AB%B1%B1%B4%F3%D1%A7%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2015ACM/ICPC亚洲区沈阳站-重现赛(感谢东北大学) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HYSBZ-1103\":[\"大都市meg\",80,\"POI2007\"],\"HYSBZ-2038\":[\"小Z的袜子(hose)\",1680,\"2009国家集训队\"],\"HYSBZ-1500\":[\"Islands and Bridges\",406,\"\"],\"HYSBZ-1588\":[\"营业额统计\",1270,\"HNOI2002\"],\"FZU-2082\":[\"过路费\",480,\"FOJ有奖月赛-2012年4月(校赛热身赛)\"],\"POJ-3237\":[\"Tree\",2099,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2007.06.03\\\"\\u003ePOJ Monthly--2007.06.03\\u003c/a\\u003e, Lei, Tao\\u003c/div\\u003e\"],\"HYSBZ-3123\":[\"森林\",112,\"Sdoi2013\"],\"HYSBZ-1901\":[\"Zju2112 Dynamic Rankings\",17,\"\"],\"HYSBZ-2957\":[\"OTOCI\",258,\"CROATIAN2009\"],\"HDU-5475\":[\"An easy problem\",1081,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2015+ACM%2FICPC+Asia+Regional+Shanghai+Online\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2015 ACM/ICPC Asia Regional Shanghai Online \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-12538\":[\"Version Controlled IDE\",604,null],\"POJ-2828\":[\"Buy Tickets\",8815,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2006.05.28\\\"\\u003ePOJ Monthly--2006.05.28\\u003c/a\\u003e, Zhu, Zeyuan\\u003c/div\\u003e\"],\"HDU-5239\":[\"Doom\",342,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dThe+2015+ACM-ICPC+China+Shanghai+Metropolitan+Programming+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e The 2015 ACM-ICPC China Shanghai Metropolitan Programming Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-5877\":[\"Weak Pair\",995,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2016+ACM%2FICPC+Asia+Regional+Dalian+Online\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2016 ACM/ICPC Asia Regional Dalian Online \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3974\":[\"Assign the task\",3133,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2011+Multi-University+Training+Contest+14+-+Host+by+FZU\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2011 Multi-University Training Contest 14 - Host by FZU \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4942\":[\"Game on S♂play\",164,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2014+Multi-University+Training+Contest+7\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2014 Multi-University Training Contest 7 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-5238\":[\"Calculator\",311,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dThe+2015+ACM-ICPC+China+Shanghai+Metropolitan+Programming+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e The 2015 ACM-ICPC China Shanghai Metropolitan Programming Contest \\u003c/a\\u003e \\u003c/div\\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-3333\":[\"Turing Tree\",2286,\"\\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.03.06\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDOJ Monthly Contest – 2010.03.06 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4027\":[\"Can you answer these queries?\",7016,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dThe+36th+ACM%2FICPC+Asia+Regional+Shanghai+Site+%A1%AA%A1%AA+Online+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e The 36th ACM/ICPC Asia Regional Shanghai Site —— Online Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-629D\":[\"Babaei and Birthday Cake\",4223,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/629\\\"\\u003eCodeforces Round 343 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-915E\":[\"Physical Education Lessons\",4298,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/915\\\"\\u003eEducational Codeforces Round 36 (Rated for Div. 2)\\u003c/a\\u003e\"],\"ZOJ-3522\":[\"Hide and seek\",44,null],\"SPOJ-DQUERY\":[\"D-query\",15707,\"Minesweeper\"],\"CodeForces-547E\":[\"Mike and Friends\",2150,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/547\\\"\\u003eCodeforces Round 305 (Div. 1)\\u003c/a\\u003e\"],\"HDU-5592\":[\"ZYB\\u0027s Premutation\",633,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dBestCoder+Round+%2365\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e BestCoder Round #65 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-777E\":[\"Hanoi Factory\",4359,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/777\\\"\\u003eCodeforces Round 401 (Div. 2)\\u003c/a\\u003e\"],\"HDU-1828\":[\"Picture\",2304,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dIOI+1998\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e IOI 1998 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-620E\":[\"New Year Tree\",5798,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/620\\\"\\u003eEducational Codeforces Round 6\\u003c/a\\u003e\"],\"HDU-4819\":[\"Mosaic\",891,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2013+Asia+Regional+Changchun+\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013 Asia Regional Changchun \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-3241\":[\"Object Clustering\",613,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2007.08.05\\\"\\u003ePOJ Monthly--2007.08.05\\u003c/a\\u003e, Li, Haoyuan\\u003c/div\\u003e\"],\"POJ-3481\":[\"Double Queue\",5348,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dSoutheastern+Europe+2007\\\"\\u003eSoutheastern Europe 2007\\u003c/a\\u003e\\u003c/div\\u003e\"],\"CodeForces-240F\":[\"TorCoder\",1935,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/240\\\"\\u003eCodeforces Round 145 (Div. 1, ACM-ICPC Rules)\\u003c/a\\u003e\"],\"HDU-5801\":[\"Up Sky,Mr.Zhu\",87,\"\\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+6\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2016 Multi-University Training Contest 6 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4718\":[\"The LCIS on the Tree\",357,\"\\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+Warmup2\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013 ACM/ICPC Asia Regional Online —— Warmup2 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HYSBZ-3991\":[\"寻宝游戏\",71,\"SDOI2015\"],\"HYSBZ-1452\":[\"Count\",141,\"JSOI2009\"],\"HDU-5367\":[\"digger\",125,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dBestCoder+Round+%2350+%28div.2%29\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e BestCoder Round #50 (div.2) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HYSBZ-1858\":[\"序列操作\",124,\"Scoi2010\"],\"HDU-4553\":[\"约会安排\",1162,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2013%BD%F0%C9%BD%CE%F7%C9%BD%BE%D3%B4%B4%D2%E2%D3%CE%CF%B7%B3%CC%D0%F2%CC%F4%D5%BD%C8%FC%A1%AA%A1%AA%B3%F5%C8%FC%A3%A83%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013金山西山居创意游戏程序挑战赛——初赛(3) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1166\":[\"敌兵布阵\",38926,\"\"],\"CodeForces-817F\":[\"MEX Queries\",2577,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/817\\\"\\u003eEducational Codeforces Round 23\\u003c/a\\u003e\"],\"CodeForces-558E\":[\"A Simple Task\",6121,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/558\\\"\\u003eCodeforces Round 312 (Div. 2)\\u003c/a\\u003e\"],\"HDU-5919\":[\"Sequence II\",996,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2016%D6%D0%B9%FA%B4%F3%D1%A7%C9%FA%B3%CC%D0%F2%C9%E8%BC%C6%BE%BA%C8%FC%A3%A8%B3%A4%B4%BA%A3%A9-%D6%D8%CF%D6%C8%FC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2016中国大学生程序设计竞赛(长春)-重现赛 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-1151\":[\"Atlantis\",7175,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dMid-Central+European+Regional+Contest+2000\\\"\\u003eMid-Central European Regional Contest 2000\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2482\":[\"Stars in Your Window\",2525,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Contest\\\"\\u003ePOJ Contest\\u003c/a\\u003e,Author:kinfkong@ZSU\\u003c/div\\u003e\"],\"SPOJ-OTOCI\":[\"OTOCI\",599,\"Croatian Olympiad in Informatics 28.03.2009.\"],\"POJ-2761\":[\"Feed the dogs\",3621,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2006.02.26\\\"\\u003ePOJ Monthly--2006.02.26\\u003c/a\\u003e,zgl \\u0026amp; twb\\u003c/div\\u003e\"],\"HYSBZ-2653\":[\"middle\",200,\"\"],\"HDU-1698\":[\"Just a Hook\",18472,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2008+%A1%B0Sunline+Cup%A1%B1+National+Invitational+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2008 “Sunline Cup” National Invitational Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4605\":[\"Magic Ball Game\",575,\"\\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+1\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013 Multi-University Training Contest 1 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-2886\":[\"Who Gets the Most Candies?\",3443,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2006.07.30\\\"\\u003ePOJ Monthly--2006.07.30\\u003c/a\\u003e, Sempr\\u003c/div\\u003e\"],\"HDU-4729\":[\"An Easy Problem for Elfness\",224,\"\\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\"],\"URAL-1553\":[\"Caves and Tunnels\",1731,\"Novosibirsk SU Contest. Petrozavodsk training camp, September 2007\"],\"HYSBZ-1208\":[\"宠物收养所\",733,\"HNOI2004\"],\"POJ-2528\":[\"Mayor\\u0027s posters\",14600,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dAlberta+Collegiate+Programming+Contest+2003.10.18\\\"\\u003eAlberta Collegiate Programming Contest 2003.10.18\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-3473\":[\"Minimum Sum\",726,\"\\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%A84%A3%A9%A1%AA%A1%AAHost+by+UESTC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 ACM-ICPC Multi-University Training Contest(4)——Host by UESTC \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4325\":[\"Flowers\",1187,\"\\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+3\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2012 Multi-University Training Contest 3 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-2665\":[\"Kth number\",4001,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDU%C4%D0%C9%FA%D7%A8%B3%A1%B9%AB%BF%AA%C8%FC%A1%AA%A1%AA%B8%CF%D4%DA%C5%AE%C9%FA%D6%AE%C7%B0%CF%C8%B9%FD%BD%DA%A3%A8From+WHU%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDU男生专场公开赛——赶在女生之前先过节(From WHU) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-5412\":[\"CRB and Queries\",697,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2015+Multi-University+Training+Contest+10\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2015 Multi-University Training Contest 10 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-6183\":[\"Color it\",588,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2017ACM%2FICPC%B9%E3%CE%F7%D1%FB%C7%EB%C8%FC-%D6%D8%CF%D6%C8%FC%A3%A8%B8%D0%D0%BB%B9%E3%CE%F7%B4%F3%D1%A7%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2017ACM/ICPC广西邀请赛-重现赛(感谢广西大学) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-626G\":[\"Raffles\",553,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/626\\\"\\u003e8VC Venture Cup 2016 - Elimination Round\\u003c/a\\u003e\"],\"HDU-5372\":[\"Segment Game\",517,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2015+Multi-University+Training+Contest+7\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2015 Multi-University Training Contest 7 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-5493\":[\"Queue\",756,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2015+ACM%2FICPC+Asia+Regional+Hefei+Online\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2015 ACM/ICPC Asia Regional Hefei Online \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HYSBZ-2809\":[\"dispatching\",319,\"Apio2012\"],\"NBUT-1457\":[\"Sona\",325,\"XadillaX\"],\"POJ-3580\":[\"SuperMemo\",2377,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Founder+Monthly+Contest+%E2%80%93+2008.04.13\\\"\\u003ePOJ Founder Monthly Contest – 2008.04.13\\u003c/a\\u003e, Yao Jinyu\\u003c/div\\u003e\"],\"HYSBZ-1036\":[\"树的统计Count\",1293,\"ZJOI2008\"],\"UVA-12345\":[\"Dynamic len(set(a[L:R]))\",1094,null],\"HDU-4614\":[\"Vases and Flowers\",2565,\"\\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\"],\"HDU-5306\":[\"Gorgeous Sequence\",2085,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2015+Multi-University+Training+Contest+2\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2015 Multi-University Training Contest 2 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HYSBZ-4546\":[\"codechef XRQRS\",0,\"\"],\"POJ-3667\":[\"Hotel\",6308,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2008+February+Gold\\\"\\u003eUSACO 2008 February Gold\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HYSBZ-3572\":[\"九连环\",100,\"\"],\"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\"],\"HYSBZ-2002\":[\"No Linear Sequences\",1019,\"Usaco2005 Feb\"],\"HYSBZ-2243\":[\"染色\",711,\"SDOI2011\"],\"HYSBZ-3211\":[\"花神游历各国\",350,\"\\u003cp\\u003e\\u003ca href\\u003d\\\"http://www.lydsy.com/JudgeOnline/problemset.php?search\\u003dSPOJ2713 gss4 数据已加强\\\"\\u003eSPOJ2713 gss4 数据已加强\\u003cbr\\u003e \\u003cbr\\u003e \\u003c/a\\u003e\\u003c/p\\u003e\"],\"LightOJ-1089\":[\"Points in Segments (II)\",2043,null],\"HDU-4578\":[\"Transformation\",2570,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2013ACM-ICPC%BA%BC%D6%DD%C8%FC%C7%F8%C8%AB%B9%FA%D1%FB%C7%EB%C8%FC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013ACM-ICPC杭州赛区全国邀请赛 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-5029\":[\"Relief grain\",658,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2014+ACM%2FICPC+Asia+Regional+Guangzhou+Online\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2014 ACM/ICPC Asia Regional Guangzhou Online \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-5700\":[\"区间交\",500,\"\\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+Round2B%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2016\\\"百度之星\\\" - 初赛(Astar Round2B) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3487\":[\"Play with Chain\",1663,\"\\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%A85%A3%A9%A1%AA%A1%AAHost+by+BJTU\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 ACM-ICPC Multi-University Training Contest(5)——Host by BJTU \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HYSBZ-2648\":[\"奇怪的游戏\",160,\"SCOI2012\"],\"HDU-3642\":[\"Get The Treasury\",917,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2010+Asia+Regional+Hangzhou+Site+%A1%AA%A1%AA+Online+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 Asia Regional Hangzhou Site —— Online Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-707D\":[\"Persistent Bookcase\",2873,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/707\\\"\\u003eCodeforces Round 368 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-719E\":[\"Sasha and Array\",100,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/719\\\"\\u003eCodeforces Round 373 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-786B\":[\"Legacy\",5871,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/786\\\"\\u003eCodeforces Round 406 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-786C\":[\"Till I Collapse\",2736,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/786\\\"\\u003eCodeforces Round 406 (Div. 1)\\u003c/a\\u003e\"],\"SPOJ-GSS7\":[\"Can you answer these queries VII\",1430,\"my own problems\"],\"HYSBZ-3295\":[\"3.1.3.ISBN码\",336,\"\"],\"CodeForces-762E\":[\"Radio stations\",1386,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/762\\\"\\u003eEducational Codeforces Round 17\\u003c/a\\u003e\"],\"CodeForces-940F\":[\"Machine Learning\",2662,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/940\\\"\\u003eCodeforces Round 466 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-GSS2\":[\"Can you answer these queries II\",1923,\"Description, standard program and test data by Yang Zhe\"],\"HDU-1754\":[\"I Hate It\",29397,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2007%CA%A1%C8%FC%BC%AF%D1%B5%B6%D3%C1%B7%CF%B0%C8%FC%A3%A86%A3%A9_linle%D7%A8%B3%A1\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2007省赛集训队练习赛(6)_linle专场 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HYSBZ-1146\":[\"网络管理Network\",70,\"CTSC2008\"],\"HDU-4866\":[\"Shooting\",404,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2014+Multi-University+Training+Contest+1\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2014 Multi-University Training Contest 1 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-3277\":[\"City Horizon\",3439,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2007+Open+Silver\\\"\\u003eUSACO 2007 Open Silver\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HYSBZ-1269\":[\"文本编辑器editor\",234,\"AHOI2006\"],\"CodeForces-220B\":[\"Little Elephant and Array\",10423,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/220\\\"\\u003eCodeforces Round 136 (Div. 1)\\u003c/a\\u003e\"],\"HYSBZ-3685\":[\"普通van Emde Boas树\",20,\"\\u003cp\\u003e\\u003ca href\\u003d\\\"http://www.lydsy.com/JudgeOnline/problemset.php?search\\u003dBy Zky\\\"\\u003eBy Zky\\u003c/a\\u003e\\u003c/p\\u003e\"],\"POJ-2104\":[\"K-th Number\",14078,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNortheastern+Europe+2004\\\"\\u003eNortheastern Europe 2004\\u003c/a\\u003e, Northern Subregion\\u003c/div\\u003e\"],\"HYSBZ-2759\":[\"repeats\",70,\"Baltic2004\"],\"POJ-1656\":[\"Counting Black\",6750,\"\\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+Liu+Rujia%40POJ\\\"\\u003ePOJ Monthly--2004.05.15 Liu Rujia@POJ\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HYSBZ-3207\":[\"花神的嘲讽计划Ⅰ\",63,\"\\u003cp\\u003e\\u003ca href\\u003d\\\"http://www.lydsy.com/JudgeOnline/problemset.php?search\\u003d原创 Memphis\\\"\\u003e原创 Memphis\\u003cbr\\u003e \\u003c/a\\u003e\\u003c/p\\u003e\"],\"HDU-5316\":[\"Magician\",709,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2015+Multi-University+Training+Contest+3\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2015 Multi-University Training Contest 3 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4348\":[\"To the moon\",1894,\"\\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+5\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2012 Multi-University Training Contest 5 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-5678\":[\"ztr loves trees\",116,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dBestCoder+Round+%2382+%28div.2%29\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e BestCoder Round #82 (div.2) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-609F\":[\"Frogs and mosquitoes\",1274,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/609\\\"\\u003eEducational Codeforces Round 3\\u003c/a\\u003e\"],\"CodeForces-515E\":[\"Drazil and Park\",2179,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/515\\\"\\u003eCodeforces Round 292 (Div. 2)\\u003c/a\\u003e\"],\"HDU-5274\":[\"Dylans loves tree\",393,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dBestCoder+Round+%2345\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e BestCoder Round #45 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"ZOJ-2112\":[\"Dynamic Rankings\",5748,null],\"HYSBZ-2741\":[\"【FOTILE模拟赛】L\",91,\"\\u003cp\\u003e\\u003ca href\\u003d\\\"http://www.lydsy.com/JudgeOnline/problemset.php?search\\u003dBy seter\\\"\\u003eBy seter\\u003c/a\\u003e\\u003c/p\\u003e\"],\"HDU-5726\":[\"GCD\",1863,\"\\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+1\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2016 Multi-University Training Contest 1 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HYSBZ-1136\":[\"Arc\",0,\"POI2009\"],\"POJ-2155\":[\"Matrix\",8926,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly\\\"\\u003ePOJ Monthly\\u003c/a\\u003e,Lou Tiancheng\\u003c/div\\u003e\"],\"POJ-3123\":[\"Ticket to Ride\",281,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNorthwestern+Europe+2006\\\"\\u003eNorthwestern Europe 2006\\u003c/a\\u003e\\u003c/div\\u003e\"],\"CodeForces-86D\":[\"Powerful array\",14557,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/86\\\"\\u003eYandex.Algorithm 2011: Round 2\\u003c/a\\u003e\"],\"HYSBZ-2588\":[\"Spoj 10628. Count on a tree\",209,\"\\u003cp\\u003e\\u003ca href\\u003d\\\"http://www.lydsy.com/JudgeOnline/problemset.php?search\\u003d鸣谢seter\\\"\\u003e鸣谢seter\\u003c/a\\u003e\\u003c/p\\u003e\"],\"POJ-2831\":[\"Can We Build This One?\",555,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2006.05.28\\\"\\u003ePOJ Monthly--2006.05.28\\u003c/a\\u003e, zhucheng\\u003c/div\\u003e\"],\"UVA-11990\":[\"``Dynamic\\u0027\\u0027 Inversion\",887,null],\"HYSBZ-3674\":[\"可持久化并查集加强版\",172,\"\\u003cp\\u003e\\u003ca href\\u003d\\\"http://www.lydsy.com/JudgeOnline/problemset.php?search\\u003d出题人大SB++\\\"\\u003e出题人大SB++\\u003c/a\\u003e\\u003c/p\\u003e\"],\"POJ-3368\":[\"Frequent values\",6802,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUlm+Local+2007\\\"\\u003eUlm Local 2007\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HYSBZ-3673\":[\"可持久化并查集 by zky\",150,\"\\u003cp\\u003e\\u003ca href\\u003d\\\"http://www.lydsy.com/JudgeOnline/problemset.php?search\\u003d出题人大SB\\\"\\u003e出题人大SB\\u003cbr\\u003e \\u003c/a\\u003e\\u003c/p\\u003e\"],\"HYSBZ-1935\":[\"Tree 园丁的烦恼\",86,\"Shoi2007\"],\"HDU-5289\":[\"Assignment\",1916,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2015+Multi-University+Training+Contest+1\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2015 Multi-University Training Contest 1 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1000\":[\"A + B Problem\",204409,\"\"],\"LightOJ-1188\":[\"Fast Queries\",1760,null],\"HDU-5722\":[\"Jewelry\",107,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dBestCoder+2nd+Anniversary\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e BestCoder 2nd Anniversary \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-5324\":[\"Boring Class\",424,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2015+Multi-University+Training+Contest+3\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2015 Multi-University Training Contest 3 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"ZOJ-3612\":[\"Median\",1054,null],\"CodeForces-538F\":[\"A Heap of Heaps\",1649,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/538\\\"\\u003eCodeforces Round 300\\u003c/a\\u003e\"],\"CodeForces-635D\":[\"Factory Repairs\",61,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/635\\\"\\u003e8VC Venture Cup 2016 - Final Round (Div. 2 Edition)\\u003c/a\\u003e\"],\"CodeForces-853C\":[\"Boredom\",1466,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/853\\\"\\u003eCodeforces Round 433 (Div. 1, based on Olympiad of Metropolises)\\u003c/a\\u003e\"],\"HYSBZ-1095\":[\"Hide 捉迷藏\",105,\"ZJOI2007\"],\"HYSBZ-3153\":[\"Sone1\",18,\"\\u003cp\\u003e\\u003ca href\\u003d\\\"http://www.lydsy.com/JudgeOnline/problemset.php?search\\u003dSone提供\\\"\\u003eSone提供\\u003c/a\\u003e\\u003c/p\\u003e\"],\"POJ-1195\":[\"Mobile phones\",8490,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dIOI+2001\\\"\\u003eIOI 2001\\u003c/a\\u003e\\u003c/div\\u003e\"],\"CodeForces-594D\":[\"REQ\",1620,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/594\\\"\\u003eCodeforces Round 330 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-380C\":[\"Sereja and Brackets\",14698,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/380\\\"\\u003eCodeforces Round 223 (Div. 1)\\u003c/a\\u003e\"],\"HDU-3436\":[\"Queue-jumpers\",787,\"\\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%A81%A3%A9%A1%AA%A1%AAHost+by+FZU\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 ACM-ICPC Multi-University Training Contest(1)——Host by FZU \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4008\":[\"Parent and son\",447,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dThe+36th+ACM%2FICPC+Asia+Regional+Dalian+Site+%A1%AA%A1%AA+Online+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e The 36th ACM/ICPC Asia Regional Dalian Site —— Online Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4366\":[\"Successor\",827,\"\\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\"],\"HDU-1890\":[\"Robotic Sort\",1565,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2008+%A1%B0Shun+Yu+Cup%A1%B1+Zhejiang+Collegiate+Programming+Contest+-+Warm+Up%A3%A82%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2008 “Shun Yu Cup” Zhejiang Collegiate Programming Contest - Warm Up(2) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HYSBZ-1926\":[\"粟粟的书架\",41,\"Sdoi2010\"],\"HDU-1255\":[\"覆盖的面积\",3467,\"\"],\"UVALive-3662\":[\"Another Minimum Spanning Tree\",185,\"Regionals 2006 \\u003e\\u003e Asia - Beijing\"],\"HDU-3710\":[\"Battle over Cities\",99,\"\\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\"],\"LightOJ-1348\":[\"Aladdin and the Return Journey\",1561,null],\"CodeForces-703D\":[\"Mishka and Interesting sum\",3607,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/703\\\"\\u003eCodeforces Round 365 (Div. 2)\\u003c/a\\u003e\"],\"HDU-5052\":[\"Yaoge’s maximum profit\",388,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2014+ACM%2FICPC+Asia+Regional+Shanghai+Online\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2014 ACM/ICPC Asia Regional Shanghai Online \\u003c/a\\u003e \\u003c/div\\u003e\"],\"SPOJ-COT\":[\"Count on a tree\",3553,\"Just for fun...\"],\"HYSBZ-3261\":[\"最大异或和\",131,\"\"],\"SPOJ-QTREE\":[\"Query on a tree\",7718,\"\"],\"CodeForces-840D\":[\"Destiny\",3043,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/840\\\"\\u003eCodeforces Round 429 (Div. 1)\\u003c/a\\u003e\"],\"SPOJ-COT4\":[\"Count on a trie\",69,\"\"],\"HYSBZ-3262\":[\"陌上花开\",300,\"\"],\"POJ-3264\":[\"Balanced Lineup\",23675,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2007+January+Silver\\\"\\u003eUSACO 2007 January Silver\\u003c/a\\u003e\\u003c/div\\u003e\"],\"CodeForces-484E\":[\"Sign on Fence\",2385,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/484\\\"\\u003eCodeforces Round 276 (Div. 1)\\u003c/a\\u003e\"]}","joined":false,"groups":{}},"managingGroups":{},"author":"ACMWGR","updateTime":1568269540000,"title":"数据结构","dislikeCnt":0,"content":"线段树\n[problem:HDU-1166][problem:HDU-1754][problem:POJ-3468][problem:POJ-2528][problem:HDU-1698][problem:ZOJ-1610][problem:POJ-3264][problem:HDU-4027][problem:HDU-1540][problem:HDU-3974][problem:HDU-4578][problem:HDU-4614][problem:HDU-4553][problem:POJ-1177][problem:HDU-1255][problem:HDU-1542][problem:HDU-3642][problem:HDU-5306][problem:HYSBZ-3211][problem:HYSBZ-5312][problem:HDU-5316][problem:HDU-5367][problem:HDU-5592][problem:HDU-5722][problem:HDU-5828][problem:HDU-5862][problem:HYSBZ-2957][problem:HYSBZ-1858][problem:CodeForces-500E][problem:CodeForces-515E][problem:CodeForces-558E][problem:CodeForces-594D][problem:CodeForces-609F][problem:CodeForces-620E][problem:CodeForces-626G][problem:CodeForces-629D][problem:CodeForces-635D][problem:CodeForces-719E][problem:CodeForces-777E][problem:CodeForces-786B][problem:HDU-5238][problem:HDU-5239][problem:HDU-5289][problem:HDU-5324][problem:HDU-5372][problem:HDU-5412][problem:HDU-5475][problem:HDU-5493][problem:HDU-5634][problem:HDU-5700][problem:HDU-5726][problem:HDU-5877][problem:HYSBZ-6070][problem:HYSBZ-1103][problem:HYSBZ-3295]\n\n二维线段树树状数组\n[problem:CodeForces-240F][problem:HDU-1823][problem:HDU-4819][problem:HDU-5517][problem:HYSBZ-1452][problem:POJ-1195][problem:POJ-1656][problem:POJ-2155][problem:UVA-11297]\n\n动态开点线段树\n[problem:HDU-6183][problem:CodeForces-915E]\n\n线段树离散化+扫描线\n[problem:HDU-4325][problem:UVALive-7141][problem:POJ-3277][problem:HDU-3333][problem:LightOJ-1089][problem:POJ-3368][problem:ZOJ-3612][problem:POJ-3470][problem:POJ-3109][problem:UVA-11990][problem:HDU-1828][problem:HDU-4419][problem:POJ-2482][problem:CodeForces-817F]\n\n\n线段树 LCA树链剖分\n[problem:POJ-2828][problem:POJ-3667][problem:POJ-1151][problem:POJ-2761][problem:POJ-2886][problem:HDU-4942][problem:HDU-4008][problem:HDU-5274][problem:HDU-3966][problem:HDU-4729][problem:HDU-3710][problem:POJ-2831][problem:HDU-4718][problem:HDU-5029][problem:HDU-5052][problem:POJ-3237][problem:FZU-2082][problem:LightOJ-1348]\n\n伸展树(splaytree)\n[problem:POJ-3481][problem:HDU-1890][problem:HDU-3436][problem:HDU-3487][problem:HYSBZ-1588][problem:HYSBZ-1208][problem:HYSBZ-1269][problem:HYSBZ-1500][problem:POJ-3580][problem:HDU-2475][problem:HDU-3726]\n\n主席树\n[problem:POJ-2104][problem:SPOJ-COT][problem:SPOJ-COT2][problem:SPOJ-COT4][problem:ZOJ-2112][problem:CodeForces-484E][problem:CodeForces-538F][problem:CodeForces-547E][problem:CodeForces-707D][problem:CodeForces-786C][problem:CodeForces-840D][problem:CodeForces-853C][problem:HDU-2665][problem:HDU-3727][problem:HDU-4348][problem:HDU-4417][problem:HDU-4605][problem:HDU-4866][problem:HDU-5678][problem:HDU-5919][problem:HDU-6278][problem:HYSBZ-1926][problem:HYSBZ-2588][problem:HYSBZ-2653][problem:HYSBZ-2809][problem:HYSBZ-3123][problem:HYSBZ-3207][problem:HYSBZ-3673][problem:HYSBZ-3674][problem:HYSBZ-3932][problem:POJ-2104POJ][problem:2761-UVA]\n\n莫队算法\n[problem:HYSBZ-2038][problem:NBUT-1457][problem:POJ-3241][problem:UVALive-3662][problem:CodeForces-220B][problem:CodeForces-940F][problem:CodeForces-617E][problem:SPOJ-GSS2][problem:SPOJ-DQUERY][problem:CodeForces-86D][problem:LightOJ-1188][problem:UVA-12345]\n\n二维偏序\n[problem:CodeForces-380C][problem:CodeForces-703D][problem:CodeForces-707D][problem:HDU-4366][problem:HYSBZ-1878]\n\n划分树\n[problem:HDU-3473]\n\n\n\n斯坦纳树\n[problem:POJ-3123]\n\n虚树\n[problem:HYSBZ-3991][problem:HYSBZ-2286][problem:HYSBZ-3572]\n\n点分治\n[problem:POJ1741-HYSBZ][problem:2152-HYSBZ]\n\nCDQ分治\n[problem:HYSBZ-3262][problem:HYSBZ-2648][problem:HYSBZ-1935][problem:HYSBZ-1136][problem:HYSBZ-3295][problem:HDU-5324][problem:CodeForces-762E]\n\n动态树LCT\n[problem:SPOJ-QTREE][problem:HYSBZ-2759][problem:HYSBZ-3153][problem:HYSBZ-2049][problem:HDU-4010][problem:HYSBZ-2002][problem:URAL-1553][problem:SPOJ-OTOCI][problem:HYSBZ-1095][problem:HYSBZ-1036][problem:HDU-1000][problem:HYSBZ-2243][problem:ZOJ-3522][problem:SPOJ-GSS7]\n\n可持久化结构\n[problem:HYSBZ-2741][problem:HDU-5801][problem:HYSBZ-3685][problem:HYSBZ-3489][problem:HYSBZ-1901][problem:HYSBZ-1146][problem:HYSBZ-3261][problem:HYSBZ-4546][problem:UVA-12538]","threadId":45911,"likeCnt":19,"createTime":1554191614000,"isWorkbook":true,"viewCnt":7847,"openness":2,"fav":false,"id":999,"trustable":false}