Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"洛谷-P4568\":[\"飞行路线\",16634,\"JLOI2011\"],\"HDU-1569\":[\"方格取数(2)\",1562,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHappy+2007\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Happy 2007 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"洛谷-P6822\":[\"Tax\",516,\"PA2012\"],\"POJ-2699\":[\"The Maximum Number of Strong Kings\",943,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dTaiwan+2004\\\"\\u003eTaiwan 2004\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1149\":[\"PIGS\",6905,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dCroatia+OI+2002+Final+Exam+-+First+day\\\"\\u003eCroatia OI 2002 Final Exam - First day\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3469\":[\"Dual Core CPU\",4506,\"\\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\"],\"洛谷-P2648\":[\"赚钱\",1968,null],\"洛谷-P1613\":[\"跑路\",14410,null],\"洛谷-P3119\":[\"Grass Cownoisseur G\",4360,\"USACO15JAN\"],\"HDU-5873\":[\"Football Games\",1122,\"\\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\"],\"URAL-1277\":[\"Cops and Thieves\",757,\"2003-2004 ACM Central Region of Russia Quarterfinal Programming Contest, Rybinsk, October 15-16, 2003\"],\"CodeForces-1215F\":[\"Radio Stations\",971,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1215\\\"\\u003eCodeforces Round 585 (Div. 2)\\u003c/a\\u003e\"],\"HDU-4067\":[\"Random Maze\",449,\"\\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+Fuzhou+Site+%A1%AA%A1%AA+Online+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e The 36th ACM/ICPC Asia Regional Fuzhou Site —— Online Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-5876\":[\"Sparse Graph\",837,\"\\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-1565\":[\"方格取数(1)\",3257,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHappy+2007\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Happy 2007 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"ZOJ-2587\":[\"Unique Attack\",1198,null],\"HDU-4370\":[\"0 or 1\",1503,\"\\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-3281\":[\"Dining\",8100,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2007+Open+Gold\\\"\\u003eUSACO 2007 Open Gold\\u003c/a\\u003e\\u003c/div\\u003e\"],\"ZOJ-2760\":[\"How Many Shortest Path\",1396,null],\"SGU-326\":[\"Perspective\",323,null],\"SGU-438\":[\"The Glorious Karlutka River \\u003d)\",276,null],\"ZOJ-2071\":[\"Technology Trader\",229,null],\"洛谷-P2783\":[\"有机化学之神偶尔会做作弊\",2291,null],\"洛谷-P1341\":[\"无序字母对\",12336,null]}","joined":false,"groups":{}},"managingGroups":{},"author":"sdldw","updateTime":1701504115000,"title":"图论专练篇","dislikeCnt":0,"content":"## 最短路\n [problem:洛谷-P1613] \n [problem:洛谷-P3404]\n\t [problem:HDU-4370]\n\t [problem:HDU-5876]\n## 连通性\t\t\n [problem:洛谷-P2783] \n ## 拓扑排序与关键路径\u0026欧拉路径\n [problem:洛谷-P1341] \n## 建图技巧\n [problem:洛谷-P2648] \t 虚点建图\n\n [problem:CodeForces-1215F]\n\n [problem:洛谷-P6822] 化点为边\n [problem:洛谷-P4568] \n [problem:洛谷-P3119] \n \n\n## 二分图与网络流\n \n\n [problem:URAL-1277] 无向图点带权的点连通度问题\n\n [problem:HDU-5873] 竞赛图\n\n [problem:ZOJ-2760] \n\n [problem:SGU-438]动态流\n\n[problem:HDU-1569]最大点权独立集\n[problem:HDU-1565]最大点权独立集\n[problem:ZOJ-2587]\n[problem:ZOJ-2071]\n[problem:POJ-3469]\n \n\n[problem:HDU-4067]双重边权问题 \n[problem:POJ-1149]\n[problem:POJ-3281]\n[problem:POJ-2699]\n[problem:SGU-326]\n ","threadId":177241,"likeCnt":0,"createTime":1701504069000,"isWorkbook":true,"viewCnt":165,"openness":2,"fav":false,"id":4335,"trustable":false}