【bzoj1475】方格取数

老题，最小割，直接贴代码了
话说，bzoj的数据范围和codevs不一样我还RE了两遍，WA的一下就哭出来了

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<queue>

using namespace std;
const int N=5000,inf=0x3f3f3f3f;
int pic[50][50],num[N],cur[N],p[N],d[N],head[N];
int n,t,s,te,sz,tot;
struct edge{
    int u,v,cap,flow,next;
}e[100010];
queue<int>q;
void add(int u,int v,int cap)
{
    e[++te].u=u;
    e[te].v=v;
    e[te].flow=0;
    e[te].cap=cap;
    e[te].next=head[u];
    head[u]=te;
}
void insert(int u,int v,int cap){add(u,v,cap),add(v,u,0);}
void bfs()
{
    memset(d,0,sizeof(d));
    while(!q.empty())q.pop();
    q.push(t);
    while(!q.empty())
    {
        int v=q.front();
        for (int i=head[v];i;i=e[i].next)
        {
            int u=e[i].v;
            if (e[i].cap==0&&!d[u])
            {
                d[u]=d[v]+1;
                q.push(u);
            }
        }
        q.pop();
    }
}   
int augment()
{
    int a=inf,x=t;
    while(x!=s)
    {
        a=min(e[p[x]].cap-e[p[x]].flow,a);
        x=e[p[x]].u;
    }
    x=t;
    while(x!=s)
    {
        e[p[x]].flow+=a;
        e[p[x]^1].flow-=a;
        x=e[p[x]].u;
    }
    return a;
}
int isap()
{
    int flow=0,x=s;
    copy(head,head+n+1,cur);
    memset(num,0,sizeof(num));
    bfs();
    for (int i=1;i<=n;i++)
    num[d[i]]++;
    while(d[s]<n)
    {
        if (x==t)
        {
            flow+=augment();
            x=s;
        }
        int ok=0;
        for (int i=cur[x];i;i=e[i].next)
        {
            int v=e[i].v;
            if (e[i].cap>e[i].flow&&d[v]+1==d[x])
            {
                p[v]=i;
                ok=1;
                cur[x]=i;
                x=v;
                break;
            }
        }
        if (!ok)
        {
            if (--num[d[x]]==0)break;
            int mx=n-1;
            for (int i=head[x];i;i=e[i].next)
            {
                int v=e[i].v;
                if (e[i].cap>e[i].flow)mx=min(mx,d[v]);
            }
            ++num[d[x]=mx+1];
            cur[x]=head[x];
            if (x!=s)x=e[p[x]].u;
        }
    }
    return flow;
}
int main()
{
    scanf("%d",&n);
    te=1,sz=n*n,s=sz+1,t=sz+2,tot=0;
    for (int i=1;i<=n;i++)
    {
        for (int j=1;j<=n;j++)
        {
            scanf("%d",&pic[i][j]);
            tot+=pic[i][j];
            if ((i+j)&1)
            {
                insert(s,(i-1)*n+j,pic[i][j]);
                if (i>1)insert((i-1)*n+j,(i-2)*n+j,inf);
                if (i<n)insert((i-1)*n+j,i*n+j,inf);
                if (j>1)insert((i-1)*n+j,(i-1)*n+j-1,inf);
                if (j<n)insert((i-1)*n+j,(i-1)*n+j+1,inf);
            } 
            else insert((i-1)*n+j,t,pic[i][j]);
        }
    }
    n=t;
//  for (int i=2;i<=te;i+=2)
//  cout<<e[i].u<<' '<<e[i].v<<' '<<e[i].cap<<endl;
    printf("%d",tot-isap());
 }