HDU 4009 Transfer water

最小树形图模板题

#include 
#include 
#include 
#include 
#include 
using namespace std;
int n,X,Y,Z;
struct node
{
	int x,y,z;
}vill[1200];
const int MAXM=40010;
const int MAXN=1010;
const int INF=0x3f3f3f3f;
int dis(node a,node b){
	return abs(a.x-b.x)+abs(a.y-b.y)+abs(a.z-b.z);
}
struct Edge
{
	int u,v,cost;
}edge[MAXM];
int pre[MAXN],id[MAXN],visit[MAXN],in[MAXN];
int zhuliu(int root,int n,int m,Edge edge[]){
	int res=0,u,v;
	while(1){
		for(int i=0;ivill[i].z){
					edge[L].cost+=Z;
				}
				L++;
			}
		}
		int ans=zhuliu(0,n+1,L,edge);
		if(ans!=-1)
            printf("%d\n",ans);
        else
            printf("poor XiaoA\n");
	}
	return 0;
}