USACO算法系列三十八——milk6

    题目：http://www.nocow.cn/index.php/Translate:USACO/milk6

    这道题超级麻烦，想了我好几天，现在能写出来的方案，也只能解决小数据量问题，对于大数据量问题还是很有难度。

    我的方法是：首先，这是一道最大流最小割问题，也就是在去掉k条边以后，使得左右两侧的边的节点之间的流为最大流，并且k最小。

    因此，第一步我先求出图的最大流。使用的就是前面求出最大流的方法。

             第二步采用广度遍历的方法去除边，判断是否能断开，但是随着边数的增加，深度不断增加，空间成几何级增长。一下子就超出了。

    代码如下：

#include <iostream> #include <fstream> #include <string.h> #define SIZE 1001 #define LENGTH 33 #define LARGER 0X7FFFFFFF #define min(a,b) (a)>(b)?(b):(a) #define BIGSIZE 10000 using namespace std; //卡车 struct Truck { int s; int e; int c; }; ifstream fin("milk6.in"); ofstream fout("milk6.out"); //卡车 Truck truck[SIZE]; int tl =0; //地图 int map[LENGTH][LENGTH] = {0}; int n, m; int path[SIZE][2] = {0}; int flow[SIZE]; int pl =0; bool isuse[SIZE]; int cutpath[BIGSIZE][2] = {0}; int cl =0; int cutresult[SIZE] = {0}; int rl = 0; int maxflow = 0; bool BFSMap(int edge) { map[truck[edge].s][truck[edge].e] -= truck[edge].c; memset(isuse, false, sizeof(bool) * SIZE); path[0][0] = 1; isuse[1] = true; pl = 1; for (int i=0; i < pl ;i ++) { int index = path[i][0]; for (int j=1; j <= n; j ++) { if (map[index][j] > 0 && isuse[j] == false) { isuse[j] = true; path[pl][0] = j; pl ++; if (j == n) { return true; } }//end if }//end for j }//end for i return false; } bool BFSCutTruck(int start) { int remain = maxflow; //先删除这些点 int s = start; while (s != 0) { int index = cutpath[s][0]; map[truck[index].s][truck[index].e] -= truck[index].c; remain -= truck[index].c; s =cutpath[s][1]; }//end while for(int i=cutpath[start][0]+1; i < m; i ++) { if (remain >= truck[i].c) { cutpath[cl][0] = i; cutpath[cl][1] = start; cl ++; if (remain - truck[i].c == 0 ) { if (!BFSMap(i)) { return true; } }//end if }//end if remain >= truck[i].c }//end for i //先增加这些点 s = start; while (s !=0) { int index = cutpath[s][0]; map[truck[index].s][truck[index].e] += truck[index].c; s =cutpath[s][1]; }//end while return false; } //广度流 int BFSStream() { memset(isuse, false, sizeof(bool) * SIZE); path[0][0] = 1; path[0][1] = -1; flow[0] = LARGER; isuse[1] = true; pl = 1; for (int i=0; i < pl; i ++) { int s = path[i][0]; for (int j=1; j <= n; j ++) { if (map[s][j] > 0 && isuse[j] == false) { path[pl][0] = j; path[pl][1] = i; isuse[j] = true; flow[pl] = min(flow[i], map[s][j]); if (j == n) //结束 { int temp = path[pl][1]; int end = pl; while (temp != -1) { int s1 = path[temp][0]; int e1 = path[end][0]; map[s1][e1] -= flow[pl]; map[e1][s1] += flow[pl]; end = temp; temp = path[temp][1]; } return flow[pl]; }//end j == n; pl ++; }//end if }//end for j }//end for i return -1; } int main() { //输入数据 fin >> n >> m; for (int i=0; i < m; i ++) { fin >> truck[tl].s >> truck[tl].e >> truck[tl].c; map[truck[tl].s][truck[tl].e] += truck[tl].c; tl ++; } //寻找最大流 int temp = BFSStream(); while (temp != -1) { maxflow += temp; temp = BFSStream(); } //初始化 memset(map, 0, sizeof(int) * LENGTH * LENGTH); for (int i=0; i <m; i ++ ) { map[truck[i].s][truck[i].e] += truck[i].c; } cutpath[0][0] = -1; cutpath[0][1] = -1; cl = 1; for (int i =0; i < cl; i ++) { if (BFSCutTruck(i)) { break; } } int start = cl-1; while (start != 0) { cutresult[rl] = cutpath[start][0]; start = cutpath[start][1]; rl ++; } fout << maxflow << " "<< rl << endl; for (int i= rl-1; i >= 0; i --) { fout << cutresult[i]+1 << endl; } return 0; }

     在运行如下数据的时候，空间不够用，数组越界了

10 20 1 10 72 1 10 590 1 10 554 1 10 436 1 10 817 1 10 695 1 10 122 1 10 650 1 10 510 1 10 266 1 10 803 1 10 882 1 10 572 1 10 998 1 10 783 1 10 799 1 10 933 1 10 793 1 10 422 1 10 354