MPI Maelstrom Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 4017 Acc…
分类：Online Judge POJ
ACM/ICPC 之 有流量上下界的网络流-Dinic(可做模板)(POJ2396)
//有流量上下界的网络流 //Time:47Ms Memory:1788K #include<iostream> #include<cstring> #include&…
POJ 1236 Network of Schools （有向图的强连通分量）
Network of Schools Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 9073 …
POJ 3648 Wedding（2-SAT）
Wedding Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 5880 Accepted: 1802 Sp…
POJ 1113 Wall （凸包）
Wall Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 21502 Accepted: 7048 Description…
POJ 1470 Closest Common Ancestors （LCA, dfs+ST在线算法）
Closest Common Ancestors Time Limit: 2000MS Memory Limit: 10000K Total Submissions: 1337…
POJ 3422 Kaka's Matrix Travels（费用流）
Kaka’s Matrix Travels Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 6…
POJ 1166 The Clocks（暴搜）
The Clocks Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 12403 Accepted: 4908 Descr…
ACM/ICPC 之 Dinic算法（POJ2112）
Optimal Milking //二分枚举最大距离的最小值+Floyd找到最短路+Dinic算法 //参考图论算法书，并对BFS构建层次网络算法进行改进 //Time:157Ms Memory:652…
