hdu1569方格取數(2)

跟hdu1565是一樣的，但是杭電現在真的判不出來數組越界了，這已經是第二次了！！！

#include <iostream>
#include <cstdio>
using namespace std;
const int oo=1e9;
const int mm=1111111;
const int mn=9999;
struct Node
{
    int i,j,id,c;
}nod[mn];

int node,src,dest,edge;
int ver[mm],flow[mm],next[mm];
int head[mn],work[mn],dis[mn],q[mn];
void prepare(int _node,int _src,int _dest)
{
    node=_node,src=_src,dest=_dest;
    for(int i=0;i<node;i++) head[i]=-1;
    edge=0;
}
void addedge(int u,int v,int c)
{
    ver[edge]=v;flow[edge]=c;next[edge]=head[u];head[u]=edge++;
    ver[edge]=u;flow[edge]=0;next[edge]=head[v];head[v]=edge++;
}
bool Dinic_bfs()
{
    int i,u,v,l,r=0;
    for(i=0;i<node;i++)
        dis[i]=-1;
    dis[q[r++]=src]=0;
    for(l=0;l<r;l++)
        for(i=head[u=q[l]];i>=0;i=next[i])
            if(flow[i]&&dis[v=ver[i]]<0)
            {
                dis[q[r++]=v]=dis[u]+1;
                if(v==dest) return 1;
            }
    return 0;
}
int Dinic_dfs(int u,int exp)
{
    if(u==dest) return exp;
    for(int &i=work[u],v,tmp;i>=0;i=next[i])
    {
        if(flow[i]&&dis[v=ver[i]]==dis[u]+1&&(tmp=Dinic_dfs(v,min(exp,flow[i])))>0)
        {
            flow[i]-=tmp;
            flow[i^1]+=tmp;
            return tmp;
        }
    }
    return 0;
}
int Dinic_flow()
{
    int i,ret=0,delta;
    while(Dinic_bfs())
    {
        for(i=0;i<node;i++)
            work[i]=head[i];
        while(delta=Dinic_dfs(src,oo))  ret+=delta;

    }
    return ret;
}
int main()
{
    int n,m,u,v,a,k,tmpx,tmpy,sum;
    while(~scanf("%d%d",&m,&n))
    {
        prepare(n*m+2,0,n*m+1);
        u=0;v=n*m-n*m/2;k=-1;sum=0;
        for(int i=0;i<m;i++)
        {
            for(int j=0;j<n;j++)
            {
                scanf("%d",&nod[++k].c);
                sum+=nod[k].c;
                nod[k].i=i;nod[k].j=j;
                if((i+j)%2==0)
                {
                    u++;
                    nod[k].id=u;
                }
                else
                {
                    v++;
                    nod[k].id=v;
                }
            }
        }
        for(int i=0;i<=k;i++)
        {
            //cout<<"i="<<nod[i].i<<" j="<<nod[i].j<<" c="<<nod[i].c<<" id="<<nod[i].id<<endl;
            if(nod[i].id<=n*m-n*m/2)
                addedge(0,nod[i].id,nod[i].c);
            else
                addedge(nod[i].id,n*m+1,nod[i].c);
        }
        for(int i=0;i<=k;i++)
        if(nod[i].id<=n*m-n*m/2)
        {
            tmpx=nod[i].i;
            tmpy=nod[i].j;
            if(tmpx-1>=0)   addedge(nod[i].id,nod[i-n].id,oo);
            if(tmpx+1<m)    addedge(nod[i].id,nod[i+n].id,oo);
            if(tmpy-1>=0)   addedge(nod[i].id,nod[i-1].id,oo);
            if(tmpy+1<n)    addedge(nod[i].id,nod[i+1].id,oo);
        }
        printf("%d\n",sum-Dinic_flow());
    }
    return 0;
}