摘要： 1.多路径最短路用费用流实现2.每个点要被强制流过->拆点成弧并且加下界为1的容量3.所有点向比它编号大的点连边#include <iostream>#include <stdio.h>#include <queue>#include <math.h>#include <string.h>using namespace std;#define V 1500#define E 1000000#define inf 0x3F3F3F3Fint n,m;int vis[V];int dist[V];int pre[V];#define 阅读全文