Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"POJ-1321\":[\"棋盘问题\",36024,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003d%E8%94%A1%E9%94%99%40pku\\\"\\u003e蔡错@pku\\u003c/a\\u003e\\u003c/div\\u003e\"],\"洛谷-P1596\":[\"Lake Counting S\",48201,\"USACO10OCT\"],\"洛谷-P8306\":[\"字典树\",14683,\"模板\"],\"CodeForces-1768B\":[\"Quick Sort\",22227,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1768\\\"\\u003eCodeforces Round 842 (Div. 2)\\u003c/a\\u003e\"],\"HDU-1548\":[\"A strange lift\",10310,\"\"],\"洛谷-P1996\":[\"约瑟夫问题\",111436,null],\"CodeForces-1768C\":[\"Elemental Decompress\",13623,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1768\\\"\\u003eCodeforces Round 842 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-P8703\":[\"最优包含\",474,\"蓝桥杯 2019 国 B\"],\"EOlymp-1453\":[\"Ford-Bellman\",2140,\"\"],\"POJ-3984\":[\"迷宫问题\",25549,\"\"],\"洛谷-P1914\":[\"小书童——凯撒密码\",144686,null],\"Gym-103427J\":[\"Luggage Lock\",1115,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/103427\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eThe 2021 ICPC Asia Shenyang Regional Contest\\u003c/a\\u003e\"],\"SPOJ-ADAINDEX\":[\"Ada and Indexing\",2500,\"\"],\"洛谷-P1480\":[\"A/B Problem\",35486,null],\"洛谷-P1089\":[\"津津的储蓄计划\",204248,\"NOIP2004 提高组\"],\"洛谷-P2970\":[\"Selfish Grazing S\",2310,\"USACO09DEC\"],\"洛谷-P1880\":[\"石子合并\",61220,\"NOI1995\"],\"POJ-2387\":[\"Til the Cows Come Home\",23279,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2004+November\\\"\\u003eUSACO 2004 November\\u003c/a\\u003e\\u003c/div\\u003e\"],\"CodeForces-1731B\":[\"Kill Demodogs\",16793,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1731\\\"\\u003eCodeforces Round 841 (Div. 2) and Divide by Zero 2022\\u003c/a\\u003e\"],\"洛谷-P4995\":[\"跳跳!\",31617,null],\"洛谷-P1125\":[\"笨小猴\",104542,\"NOIP2008 提高组\"],\"洛谷-P1886\":[\"滑动窗口 /【模板】单调队列\",67967,null],\"AtCoder-abc284_f\":[\"ABCBAC\",1125,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc284\\\"\\u003eAtCoder Beginner Contest 284\\u003c/a\\u003e\"],\"AtCoder-abc284_e\":[\"Count Simple Paths\",2708,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc284\\\"\\u003eAtCoder Beginner Contest 284\\u003c/a\\u003e\"],\"洛谷-P1803\":[\"凌乱的yyy / 线段覆盖\",68641,null],\"洛谷-P1090\":[\"合并果子 / [USACO06NOV] Fence Repair G\",127266,\"NOIP2004 提高组\"],\"洛谷-P2580\":[\"于是他错误的点名开始了\",32737,null],\"洛谷-P1012\":[\"拼数\",104833,\"NOIP1998 提高组\"],\"洛谷-P3435\":[\"OKR-Periods of Words\",7880,\"POI2006\"],\"洛谷-P1379\":[\"八数码难题\",28875,null],\"Gym-103186L\":[\"高低奥马哈扑克\",8,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/103186\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eThe 2021 Shanghai Collegiate Programming Contest\\u003c/a\\u003e\"],\"洛谷-P1536\":[\"村村通\",31053,null],\"Gym-103186C\":[\"小 A 的期末考试\",594,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/103186\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eThe 2021 Shanghai Collegiate Programming Contest\\u003c/a\\u003e\"],\"洛谷-P5741\":[\"旗鼓相当的对手 - 加强版\",45329,\"深基7.例10\"],\"洛谷-P1144\":[\"最短路计数\",40095,null],\"洛谷-P2597\":[\"灾难\",3627,\"ZJOI2012\"],\"洛谷-P4017\":[\"最大食物链计数\",34847,null],\"POJ-1797\":[\"Heavy Transportation\",12618,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dTUD+Programming+Contest+2004\\\"\\u003eTUD Programming Contest 2004\\u003c/a\\u003e, Darmstadt, Germany\\u003c/div\\u003e\"],\"洛谷-P1546\":[\"最短网络 Agri-Net\",26527,\"USACO3.1\"],\"洛谷-P1303\":[\"A*B Problem\",113877,null],\"洛谷-P2758\":[\"编辑距离\",27975,null],\"洛谷-P4779\":[\"单源最短路径(标准版)\",125526,\"模板\"],\"洛谷-P1305\":[\"新二叉树\",44038,null],\"洛谷-P1706\":[\"全排列问题\",109588,null],\"洛谷-P1827\":[\"美国血统 American Heritage\",27802,\"USACO3.4\"],\"洛谷-P1030\":[\"求先序排列\",62777,\"NOIP2001 普及组\"],\"洛谷-P2121\":[\"拆地毯\",7994,null],\"POJ-3461\":[\"Oulipo\",16518,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dBAPC+2006+Qualification\\\"\\u003eBAPC 2006 Qualification\\u003c/a\\u003e\\u003c/div\\u003e\"],\"LibreOJ-2603\":[\"国王游戏\",830,\"NOIP2012\"],\"洛谷-P1551\":[\"亲戚\",69690,null],\"洛谷-P2123\":[\"皇后游戏\",4163,null],\"洛谷-P1396\":[\"营救\",23385,null],\"洛谷-P1036\":[\"选数\",159985,\"NOIP2002 普及组\"],\"洛谷-P1038\":[\"神经网络\",18961,\"NOIP2003 提高组\"],\"洛谷-B3637\":[\"最长上升子序列\",25555,null],\"HDU-1869\":[\"六度分离\",4679,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2008%BA%BC%B5%E7%BC%AF%D1%B5%B6%D3%D1%A1%B0%CE%C8%FC%A1%AA%A1%AA%C8%C8%C9%ED%C8%FC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2008杭电集训队选拔赛——热身赛 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-P1714\":[\"切蛋糕\",13639,null],\"Gym-103637G\":[\"Geometric shapes\",50,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/103637\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2019-2020 10th BSUIR Open Programming Championship. Semifinal\\u003c/a\\u003e\"],\"洛谷-P4391\":[\"Radio Transmission 无线传输\",13666,\"BOI2009\"],\"CodeForces-665E\":[\"Beautiful Subarrays\",3302,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/665\\\"\\u003eEducational Codeforces Round 12\\u003c/a\\u003e\"],\"洛谷-P3183\":[\"食物链\",8378,\"HAOI2016\"],\"洛谷-P8870\":[\"B-莲子的机械动力学\",1996,\"传智杯 #5 初赛\"],\"洛谷-P4551\":[\"最长异或路径\",12186,null],\"洛谷-P8630\":[\"密文搜索\",1597,\"蓝桥杯 2015 国 B\"],\"洛谷-P1044\":[\"栈\",73137,\"NOIP2003 普及组\"],\"洛谷-P2375\":[\"动物园\",11059,\"NOI2014\"],\"Gym-102899E\":[\"KK 与答辩\",34,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/102899\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eThe 2nd Hangzhou Normal University Freshman Programming Contest\\u003c/a\\u003e\"],\"洛谷-P1047\":[\"校门外的树\",255496,\"NOIP2005 普及组\"],\"洛谷-P1443\":[\"马的遍历\",95236,null],\"洛谷-P5768\":[\"路由表\",323,\"CQOI2016\"],\"洛谷-P4316\":[\"绿豆蛙的归宿\",9518,null],\"洛谷-P1048\":[\"采药\",189977,\"NOIP2005 普及组\"],\"洛谷-P1601\":[\"A+B Problem(高精)\",173998,null],\"洛谷-P6739\":[\"Three Friends\",1762,\"BalticOI 2014 Day1\"],\"SPOJ-SUBXOR\":[\"SubXor\",1960,\"\"],\"洛谷-P1449\":[\"后缀表达式\",64415,null],\"POJ-1417\":[\"True Liars\",2107,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dJapan+2002+Kanazawa\\\"\\u003eJapan 2002 Kanazawa\\u003c/a\\u003e\\u003c/div\\u003e\"],\"洛谷-P1208\":[\"混合牛奶 Mixing Milk\",60572,\"USACO1.3\"],\"HDU-1873\":[\"看病要排队\",8640,\"\\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\"],\"洛谷-P8085\":[\"KRIPTOGRAM\",820,\"COCI2011-2012#4\"],\"洛谷-P4047\":[\"部落划分\",9370,\"JSOI2010\"],\"洛谷-P1175\":[\"表达式的转换\",5615,null],\"洛谷-P2142\":[\"高精度减法\",70813,null],\"洛谷-P2024\":[\"食物链\",36242,\"NOI2001\"],\"洛谷-P1332\":[\"血色先锋队\",18277,null],\"洛谷-P8806\":[\"搬砖\",852,\"蓝桥杯 2022 国 B\"],\"SPOJ-TRYCOMP\":[\"Try to complete\",698,\"\"],\"洛谷-P1216\":[\"[IOI1994]数字三角形 Number Triangles\",115003,\"USACO1.5\"],\"洛谷-P3879\":[\"阅读理解\",15454,\"TJOI2010\"],\"洛谷-P1616\":[\"疯狂的采药\",87400,null],\"CodeForces-1463E\":[\"Plan of Lectures\",1463,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1463\\\"\\u003eEducational Codeforces Round 100 (Rated for Div. 2)\\u003c/a\\u003e\"],\"洛谷-P1219\":[\"八皇后 Checker Challenge\",118397,\"USACO1.5\"],\"AtCoder-abc218_f\":[\"Blocked Roads\",779,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc218\\\"\\u003eAtCoder Beginner Contest 218\\u003c/a\\u003e\"],\"CodeForces-514C\":[\"Watto and Mechanism\",7179,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/514\\\"\\u003eCodeforces Round 291 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1707A\":[\"Doremy\\u0027s IQ\",13149,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1707\\\"\\u003eCodeforces Round 808 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P3366\":[\"最小生成树\",126586,\"模板\"],\"洛谷-P1064\":[\"金明的预算方案\",45100,\"NOIP2006 提高组\"],\"洛谷-P8893\":[\"智能推荐\",988,\"UOI-R1\"],\"洛谷-P6510\":[\"奶牛排队\",4252,null],\"洛谷-P3243\":[\"菜肴制作\",6138,\"HNOI2015\"],\"洛谷-P3367\":[\"并查集\",100177,\"模板\"],\"洛谷-P1104\":[\"生日\",57240,null],\"Gym-103480H\":[\"简单的 LRU 问题\",26,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/103480\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eThe 4th Hangzhou Normal University Freshman Programming Contest\\u003c/a\\u003e\"],\"POJ-3259\":[\"Wormholes\",19367,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2006+December+Gold\\\"\\u003eUSACO 2006 December Gold\\u003c/a\\u003e\\u003c/div\\u003e\"],\"洛谷-P3647\":[\"连珠线\",1467,\"APIO2014\"],\"洛谷-P1901\":[\"发射站\",12803,null],\"HDU-2066\":[\"一个人的旅行\",14323,\"\\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\"],\"HDU-3038\":[\"How Many Answers Are Wrong\",7212,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2009+Multi-University+Training+Contest+13+-+Host+by+HIT\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2009 Multi-University Training Contest 13 - Host by HIT \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UESTC-204\":[\"合并果子\",475,\"NOIP2004 提高组\"],\"洛谷-P8786\":[\"李白打酒加强版\",3698,\"蓝桥杯 2022 省 B\"],\"SPOJ-PHONELST\":[\"Phone List\",7636,\"Nordic Collegiate Programming Contest 2007\"],\"洛谷-P1195\":[\"口袋的天空\",24610,null],\"洛谷-P3370\":[\"字符串哈希\",68439,\"模板\"],\"洛谷-P3371\":[\"单源最短路径(弱化版)\",123368,\"模板\"],\"洛谷-P1194\":[\"买礼物\",17364,null],\"洛谷-P1196\":[\"银河英雄传说\",31448,\"NOI2002\"],\"洛谷-P1111\":[\"修复公路\",42126,null],\"洛谷-P1991\":[\"无线通讯网\",17835,null],\"洛谷-P8784\":[\"积木画\",2866,\"蓝桥杯 2022 省 B\"],\"洛谷-P3375\":[\"KMP\",78058,\"模板\"],\"洛谷-P1352\":[\"没有上司的舞会\",49832,null]}","joined":false,"groups":{}},"managingGroups":{},"author":"cheng1202","updateTime":1674988480000,"title":"DSA2023-寒假集训","dislikeCnt":0,"content":"C++基础与STL库\n[problem:洛谷-P1047] [problem:洛谷-P1012] [problem:HDU-1873] [problem:洛谷-P5741] [problem:洛谷-P1104] [problem:洛谷-P1125] [problem:洛谷-P2970] [problem:洛谷-P1089] [problem:洛谷-P1914] [problem:洛谷-P1090] \nhttps://vjudge.net/contest/536181#overview\n高精度与模拟\n[problem:洛谷-P1601][problem:洛谷-P2142][problem:洛谷-P1303][problem:洛谷-P1480][problem:洛谷-P8870][problem:Gym-103186C][problem:Gym-102899E][problem:Gym-103480H][problem:Gym-103637G][problem:Gym-103186L]\nhttps://vjudge.net/contest/537197#overview \n栈、队列、单调栈、单调队列\n[problem:洛谷-P1886][problem:洛谷-P1901][problem:洛谷-P1996][problem:洛谷-P1714][problem:洛谷-P1044][problem:洛谷-P6510][problem:洛谷-P1449][problem:洛谷-P1175]\nhttps://vjudge.csgrandeur.cn/contest/536656\n贪心\n[problem:洛谷-P1803][problem:洛谷-P1208][problem:洛谷-P4995][problem:UESTC-204][problem:CodeForces-1707A][problem:CodeForces-1768B][problem:CodeForces-1731B][problem:LibreOJ-2603][problem:洛谷-P2123][problem:CodeForces-1768C]\nhttps://vjudge.net/contest/537372\n二叉树与并查集\n[problem:洛谷-P3367][problem:洛谷-P1111][problem:洛谷-P1196][problem:洛谷-P1305][problem:洛谷-P1551][problem:HDU-3038][problem:洛谷-P2024][problem:洛谷-P1030][problem:POJ-1417][problem:洛谷-P1827]\nhttps://vjudge.net/contest/537566 \nKMP与字符串哈希\n[problem:洛谷-P3375][problem:POJ-3461][problem:洛谷-P4391][problem:洛谷-P8085][problem:洛谷-P3435][problem:洛谷-P2375][problem:洛谷-P3370][problem:洛谷-P8630][problem:洛谷-P6739][problem:AtCoder-abc284_f]\nhttps://vjudge.net/contest/537786\nTrie与01Trie\n[problem:洛谷-P8306][problem:SPOJ-ADAINDEX][problem:洛谷-P2580][problem:SPOJ-PHONELST][problem:洛谷-P3879][problem:SPOJ-SUBXOR][problem:CodeForces-665E][problem:洛谷-P4551][problem:CodeForces-514C][problem:SPOJ-TRYCOMP][problem:洛谷-P5768]\nhttps://vjudge.net/contest/537340\n拓扑排序\n[problem:洛谷-P8893][problem:洛谷-P4017][problem:洛谷-P3183][problem:洛谷-P1038][problem:CodeForces-1463E][problem:洛谷-P3243][problem:洛谷-P2597][problem:洛谷-P4316]\nhttps://vjudge.csgrandeur.cn/contest/538086\n最小生成树\n[problem:洛谷-P3366][problem:洛谷-P1546][problem:洛谷-P1536][problem:洛谷-P1396][problem:洛谷-P1991][problem:洛谷-P2121][problem:洛谷-P1194][problem:洛谷-P1195][problem:洛谷-P4047]\nhttps://vjudge.net/contest/538275\n穷竭搜索 dfs,bfs\n[problem:洛谷-P1706][problem:POJ-1321][problem:洛谷-P1036][problem:洛谷-P1219][problem:AtCoder-abc284_e][problem:洛谷-P1443][problem:POJ-3984][problem:洛谷-P1332][problem:洛谷-P1144][problem:洛谷-P1596][problem:洛谷-P1379][problem:Gym-103427J][problem:AtCoder-abc218_f]\nhttps://vjudge.net/contest/538183\n建图与最短路\n[problem:洛谷-P3371][problem:POJ-2387][problem:洛谷-P4779][problem:HDU-1548][problem:POJ-1797][problem:EOlymp-1453][problem:POJ-3259][problem:HDU-2066][problem:HDU-1869][problem:洛谷-P3647]\nhttps://vjudge.net/contest/538481 \n动态规划(dp)\n[problem:洛谷-P1216][problem:洛谷-B3637][problem:洛谷-P1048][problem:洛谷-P1616][problem:洛谷-P2758][problem:洛谷-P8784][problem:洛谷-P8786][problem:洛谷-P8703][problem:洛谷-P8806][problem:洛谷-P1064][problem:洛谷-P1880][problem:洛谷-P1352]\nhttps://vjudge.net/contest/538844","threadId":135167,"likeCnt":17,"createTime":1672814310000,"isWorkbook":true,"viewCnt":6888,"openness":2,"fav":false,"id":3382,"trustable":false}