poj3469

#include<iostream>
#include<stdio.h>
#include<string.h>
#include<limits.h>
#include<queue>
#define MAX 20010
using namespace std;
struct node
{
	int y;
	int cap;
	int next;
}a[MAX*100];
int h[MAX],tot;
int leve[MAX];
void addedge(int i,int j,int c)
{
	a[tot].y=j;
	a[tot].cap=c;
	a[tot].next=h[i];
	h[i]=tot++;
	a[tot].y=j;
	a[tot].cap=0;
	a[tot].next=h[j];
	h[j]=tot++;
}
bool bfs(int s,int t)
{
	int u,v,c,i;
	queue<int> q;
	memset(leve,-1,sizeof(leve));
	leve[s]=0;
	q.push(s);
	while(!q.empty())
	{
		u=q.front();
		q.pop();
		i=h[u];
		while(i!=-1)
		{
			v=a[i].y;
			if(a[i].cap>0&&leve[v]==-1)
			{
				q.push(v);
				leve[v]=leve[u]+1;
			}
			i=a[i].next;
		}
	}
	return leve[t]!=-1;
}
int dinic(int s,int t)
{
	int stack[MAX],last[MAX];
	int u,v,top=1,minf,i,temp,c,edge,sum=0;
	while(bfs(s,t))
	{
		top=1;
		stack[top]=s;
		for(i=s;i<=t;i++)
		{
			last[i]=h[i];
		}
		while(top)
		{
			u=stack[top];
			if(u==t)
			{
				minf=INT_MAX;
				for(i=1;i<top;i++)
				{
					edge=last[stack[i]];
					if(minf>a[edge].cap)
					{
						minf=a[edge].cap;
						temp=i;
					}
				}
				for(i=1;i<top;i++)
				{
					edge=last[stack[i]];
					a[edge].cap-=minf;
					a[edge^1].cap+=minf;
				}
				sum+=minf;
				top=temp;
				continue;
			}
			edge=last[u];
			while(edge!=-1)
			{
				v=a[edge].y;
				c=a[edge].cap;
				if(c>0&&leve[u]+1==leve[v])
				{
					stack[++top]=v;
					break;
				}
				edge=a[edge].next;
			}
			last[u]=edge;
			if(edge==-1)
			{
				top--;
				last[stack[top]]=a[last[stack[top]]].next;
			}
		}
	}
	return sum;
}
int main()
{
	int n,m,u,v,cap,i;
	while(scanf("%d%d",&n,&m)!=EOF)
	{
		memset(h,-1,sizeof(h));
		tot=0;
		for(i=1;i<=n;i++)
		{
			scanf("%d%d",&u,&v);
			addedge(0,i,u);
			addedge(i,n+1,v);
		}
		while(m--)
		{
			scanf("%d%d%d",&u,&v,&cap);
			addedge(u,v,cap);
			addedge(v,u,cap);
		}
		printf("%d\n",dinic(0,n+1));
	}
}

怎么建图是关键啊