POJ-1149-PIGS

做网络流的第一个题，用的最原始的方法做。

代码：

#include<cstdio>
#include<cstring>
#include<iostream>
#include<queue>
using namespace std;
const int inf=1<<29;
const int maxm=1010;
const int maxn=110;
int s,t,n,m,customer[maxn][maxn],flow[maxn][maxn],last[maxm],house[maxm];
int prev[maxn],miniflow[maxn];
queue<int> q;
void Init()
{
    memset(last,0,sizeof(last));
    memset(customer,0,sizeof(customer));
    scanf("%d%d",&m,&n);
    s=0,t=n+1;
    for(int i=1;i<=m;i++)
	scanf("%d",&house[i]);
    for(int i=1;i<=n;i++)
    {
	int num;
	scanf("%d",&num);
	for(int j=0;j<num;j++)
	{
	    int k;
	    scanf("%d",&k);
	    if(!last[k])
		customer[s][i]+=house[k];
	    else
		customer[last[k]][i]=inf;
	    last[k]=i;
	}
	scanf("%d",&customer[i][t]);
    }
}
int ford()
{
    //memset(miniflow,0,sizeof(miniflow));
    memset(flow,0,sizeof(flow));
    miniflow[0]=inf;
    while(1)
    {
	while(!q.empty())
	    q.pop();
	for(int i=0;i<maxn;i++)
	    prev[i]=-2;
	prev[0]=-1;
	q.push(0);
	while(!q.empty()&&prev[t]==-2)
	{
	    int v=q.front();
	    q.pop();
	    for(int i=0;i<=t;i++)
	    {
		if(prev[i]==-2&&(customer[v][i]-flow[v][i]))
		{
		    prev[i]=v;
		    q.push(i);
		    miniflow[i]=min(miniflow[v],customer[v][i]-flow[v][i]);
		}
	    }
	}
	if(prev[t]==-2)
	    break;
	for(int i=prev[t],j=t;i!=-1;j=i,i=prev[i])
	{
	    flow[i][j]+=miniflow[t];
	    flow[j][i]=-flow[i][j];
	}
    }
    int ans=0;
    for(int i=0;i<t;i++)
	ans+=flow[i][t];
    return ans;
}
int main()
{
    Init();
    printf("%d\n",ford());
    return 0;
}