Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"洛谷-P2763\":[\"试题库问题\",6273,null],\"洛谷-P3358\":[\"最长k可重区间集问题\",2281,null],\"洛谷-P2762\":[\"太空飞行计划问题\",5528,null],\"POJ-2594\":[\"Treasure Exploration\",3644,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2005.08.28\\\"\\u003ePOJ Monthly--2005.08.28\\u003c/a\\u003e,Li Haoyuan\\u003c/div\\u003e\"],\"洛谷-P2765\":[\"魔术球问题\",5417,null],\"洛谷-P3356\":[\"火星探险问题 \",1348,null],\"洛谷-P2764\":[\"最小路径覆盖问题\",6730,null],\"洛谷-P3357\":[\"最长k可重线段集问题\",1154,null],\"洛谷-P2766\":[\"最长不下降子序列问题\",5010,null],\"洛谷-P4009\":[\"汽车加油行驶问题\",3093,null],\"洛谷-P3381\":[\"最小费用最大流\",37433,\"模板\"],\"洛谷-P4014\":[\"分配问题\",4564,null],\"洛谷-P4015\":[\"运输问题\",4015,null],\"洛谷-P2057\":[\"善意的投票 / [JLOI2010] 冠军调查\",4448,\"SHOI2007\"],\"洛谷-P4012\":[\"深海机器人问题\",2060,null],\"洛谷-P3980\":[\"志愿者招募\",3861,\"NOI2008\"],\"洛谷-P2598\":[\"狼和羊的故事\",3171,\"ZJOI2009\"],\"洛谷-P2774\":[\"方格取数问题\",7339,null],\"洛谷-P2754\":[\"家园 / 星际转移问题\",3995,\"CTSC1999\"],\"洛谷-P4016\":[\"负载平衡问题\",6911,null],\"洛谷-P1345\":[\"奶牛的电信Telecowmunication\",5944,\"USACO5.4\"],\"洛谷-P4897\":[\"最小割树(Gomory-Hu Tree)\",2380,\"模板\"],\"洛谷-P2756\":[\"飞行员配对方案问题\",15115,null],\"洛谷-P6220\":[\"Skandi\",180,\"COCI2019-2020#6\"],\"洛谷-P3376\":[\"网络最大流\",83934,\"模板\"],\"洛谷-P3355\":[\"骑士共存问题\",6120,null],\"洛谷-P1251\":[\"餐巾计划问题\",7491,null],\"洛谷-P4001\":[\"狼抓兔子\",6530,\"ICPC-Beijing 2006\"],\"POJ-3020\":[\"Antenna Placement\",4976,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dSvenskt+M%C3%A4sterskap+i+Programmering%2FNorgesmesterskapet+2001\\\"\\u003eSvenskt Mästerskap i Programmering/Norgesmesterskapet 2001\\u003c/a\\u003e\\u003c/div\\u003e\"],\"洛谷-P3254\":[\"圆桌问题\",6295,null]}","joined":false,"groups":{}},"managingGroups":{},"author":"8101","updateTime":1696504616000,"title":"2023网络流题单","dislikeCnt":0,"content":"模板:\n最大流:\n[problem:洛谷-P3376]\n费用流:\n[problem:洛谷-P3381]\n最小割树:\n[problem:洛谷-P4897]\n上下界最大流、可行流,上下界无源无汇可行流:略\n\n例题:\n\n最小割:\n[problem:洛谷-P1345]\n[problem:洛谷-P2057]\n[problem:洛谷-P2598]\n\n最小点覆盖:\n[problem:洛谷-P6220]\n\n最大独立集:\n[problem:洛谷-P3355]\n\n最小边覆盖:\n[problem:POJ-3020]\n\n最小路径覆盖:\n[problem:洛谷-P2764]\n\n最小可相交路径覆盖:\n[problem:POJ-2594]\n\n平面图最小割:\n[problem:洛谷-P4001]\n\n其他例题:\n[problem:洛谷-P3980]\n\n网络流24题:\n[problem:洛谷-P1251]\n[problem:洛谷-P2754]\n[problem:洛谷-P2756]\n[problem:洛谷-P2762]\n[problem:洛谷-P2763]\n[problem:洛谷-P2764]\n[problem:洛谷-P2765]\n[problem:洛谷-P2766]\n[problem:洛谷-P2774]\n[problem:洛谷-P3254]\n[problem:洛谷-P3355]\n[problem:洛谷-P3356]\n[problem:洛谷-P3357]\n[problem:洛谷-P3358]\n[problem:洛谷-P4009]\n[problem:洛谷-P4012]\n[problem:洛谷-P4014]\n[problem:洛谷-P4015]\n[problem:洛谷-P4016]\n","threadId":171160,"likeCnt":0,"createTime":1696318999000,"isWorkbook":true,"viewCnt":417,"openness":2,"fav":false,"id":4125,"trustable":false}