dashuxiaoai52613的专栏

Drainage DitchesTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 20106 Accepted: 7222DescriptionEvery time it rains on Farmer Johns fields, a pond forms o

#define MAX 105 #define INF 0xffffff #include #include #include using namespace std; int cost[MAX][MAX],Pre[MAX],Min[MAX]; bool visit[MAX]; int n,np,nc,m,M=INF,s,t; int Bfs() { queue q; int temp; visit[s]=true