2017年12月15日
B - Flow Problem练习Edmond-Karp算法
摘要： Network flow is a well-known difficult problem for ACMers. Given a graph, your task is to find out the max... 阅读全文
posted @ 2017-12-15 21:40 osatalp 阅读(82) 评论(0) 推荐(0)
图算法&网络流&edmonds_karp算法
摘要： #include "stdio.h"#include "iostream"#include "algorithm"#define INF 9999999using namespace std;int map[N]... 阅读全文
posted @ 2017-12-15 19:47 osatalp 阅读(126) 评论(0) 推荐(0)