Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"LibreOJ-6008\":[\"餐巾计划\",919,\"网络流 24 题\"],\"LibreOJ-6009\":[\"软件补丁\",501,\"网络流 24 题\"],\"LibreOJ-6006\":[\"试题库\",788,\"网络流 24 题\"],\"LibreOJ-6007\":[\"方格取数\",811,\"网络流 24 题\"],\"LibreOJ-6004\":[\"圆桌聚餐\",969,\"网络流 24 题\"],\"LibreOJ-6015\":[\"星际转移\",511,\"网络流 24 题\"],\"LibreOJ-6026\":[\"集合\",11,\"by hzq84621\"],\"LibreOJ-6005\":[\"最长递增子序列\",925,\"网络流 24 题\"],\"LibreOJ-6027\":[\"质数计数 I\",125,\"from CommonAnts\"],\"LibreOJ-6002\":[\"最小路径覆盖\",1198,\"网络流 24 题\"],\"LibreOJ-6013\":[\"负载平衡\",615,\"网络流 24 题\"],\"LibreOJ-6024\":[\"XLkxc\",62,null],\"LibreOJ-6003\":[\"魔术球\",925,\"网络流 24 题\"],\"LibreOJ-6014\":[\"最长 k 可重区间集\",556,\"网络流 24 题\"],\"LibreOJ-6025\":[\"巧克力王国\",129,null],\"LibreOJ-6000\":[\"搭配飞行员\",2145,\"网络流 24 题\"],\"LibreOJ-6011\":[\"运输问题\",585,\"网络流 24 题\"],\"LibreOJ-6022\":[\"重组病毒\",90,null],\"LibreOJ-6001\":[\"太空飞行计划\",1289,\"网络流 24 题\"],\"LibreOJ-6012\":[\"分配问题\",598,\"网络流 24 题\"],\"LibreOJ-6023\":[\"疫苗\",9,null],\"LibreOJ-6010\":[\"数字梯形\",617,\"网络流 24 题\"],\"LibreOJ-6021\":[\"寻找 LCR\",113,\"from CommonAnts\"]}","joined":false,"groups":{}},"managingGroups":{},"author":"445514922","updateTime":1600331677000,"title":"网络流","dislikeCnt":0,"content":"[problem:LibreOJ-6000]\n[problem:LibreOJ-6001]\n[problem:LibreOJ-6002]\n[problem:LibreOJ-6003]\n[problem:LibreOJ-6004]\n[problem:LibreOJ-6005]\n[problem:LibreOJ-6006]\n[problem:LibreOJ-6007]\n[problem:LibreOJ-6008]\n[problem:LibreOJ-6009]\n[problem:LibreOJ-6010]\n[problem:LibreOJ-6011]\n[problem:LibreOJ-6012]\n[problem:LibreOJ-6013]\n[problem:LibreOJ-6014]\n[problem:LibreOJ-6015]\n[problem:LibreOJ-6021]\n[problem:LibreOJ-6022]\n[problem:LibreOJ-6023]\n[problem:LibreOJ-6024]\n[problem:LibreOJ-6025]\n[problem:LibreOJ-6026]\n[problem:LibreOJ-6027]","threadId":81337,"likeCnt":1,"createTime":1600331466000,"isWorkbook":true,"viewCnt":1658,"openness":2,"fav":false,"id":2459,"trustable":false}