#include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; const int N=1024; const int inf=1<<24; int abs(int x) { if(x<0) return -x; else return x; } struct { int c,f; } g[N][N]; int n,m,u,v,c,f,i,j,ans; int flag[N],p[N],a[N]; queue q; void ford() { while(1) { memset(flag,0xff,sizeof(flag)); memset(p,0xff,sizeof(p)); memset(a,0xff,sizeof(a)); a[0]=inf; p[0]=0; flag[0]=0; while(!q.empty()) q.pop(); q.push(0); while(!q.empty()&&flag[n-1]==-1) { u=q.front(); q.pop(); for(i=0; i 0) { flag[i]=0; p[i]=-u; a[i]=min(a[u],g[i][u].f); q.push(i); } } } flag[u]=1; } if(a[n-1]==0||flag[n-1]==-1) break; int k1=n-1,k2=abs(p[k1]); int add=a[n-1]; //printf(%d ,add); while(1) { if(g[k2][k1].f
?