I will Do iT @ hlyblog.net

题目描述 Network flow is a well-known difficult problem for ACMers. Given a graph, your task is to find out the maximum flow for the weighted directed graph. Input: The first line of input contains a

http://blog.csdn.net/ipqhjjybj/article/details/9172347 不说什么啦。。。这个直接是套模板的，就是前期优化了一点点，把重复边都合并了，效率提升挺明显的。 从472MS提高到了62MS，后来将 memset(a,0,sizeof(a));这样的写法改成了memset(a,0,(n+1)*sizeof(int));  时间从 62MS 调高到了46