网络流24题--方格取数

思路：最小割

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef int lint;
const lint inf = 0x3f3f3f3f;
struct dinic{
    static const int N = 50005;
    static const int M = 5000005;
    static const lint inf = 0x3f3f3f3f;
    int he[N],ne[M],ver[M],d[N];
    lint edge[M];
    int s,t,tot;
    queue<int> que;
    void init( int n ){
        for( int i = 0;i <= n;i++ ){
            he[i] = 0;
        }
        tot = 1;
    }
    void add( int x,int y,lint z ){
        ver[++tot] = y; ne[ tot ] = he[x]; he[x] = tot; edge[ tot ] = z;
        ver[++tot] = x; ne[tot] = he[y]; he[y] = tot;edge[tot] = 0;
    }
    bool bfs(){
        memset( d,0,sizeof( d ) );
        while( que.size() ) que.pop();
        que.push( s );
        d[s] = 1;
        while( que.size() ){
            int x = que.front();
            que.pop();
            for( int cure = he[x];cure;cure = ne[cure] ){
                int y = ver[cure];
                if( edge[cure] && !d[y] ){
                    que.push( y );
                    d[ y ] = d[x] + 1;
                    if( y == t ) return 1;
                }
            }
        }
        return 0;
    }
    lint dfs( int x,lint flow ){
        if( x== t ) return flow;
        lint rest = flow,k;
        for( int cure = he[x];cure && rest;cure = ne[cure] ){
            int y = ver[cure];
            if( edge[cure] && d[ y ] == d[x] + 1 ){
                k = dfs( y,min( rest,edge[cure] ) );
                if( !k ) d[ y ] = 0;
                edge[cure] -= k;
                edge[ cure^1 ] += k;
                rest -= k;
            }
        }
        return flow - rest;
    }
    lint max_flow( int x,int y ){
        s = x; t = y;
        lint maxflow = 0;
        lint flow = 0;
        while( bfs() )
            while( flow = dfs( s,inf ) ) maxflow += flow;
        return maxflow;
    }
} g;
int dx[4] = { -1,0,1,0 };
int dy[4] = {0,1,0,-1};
int main(){
   int r,c,a;
   scanf("%d%d",&r,&c);
   int sum = 0;
   int S = 0,T = r*c+1;
   g.init(T);
   for( int i = 1;i <= r;i++ ){
       for( int j = 1;j <= c;j++ ){
           scanf("%d",&a);
           sum += a;
           if( (i+j)&1 ){
               g.add( S,(i-1)*c + j,a );
               for( int k = 0;k < 4;k++ ){
                   int x = i + dx[k];
                   int y = j + dy[k];
                   if( x <= r && x>= 1 && y>= 1 && y <= c ){
                       g.add( (i-1)*c+j  ,(x-1)*c+y  ,inf );
                   }
               }
           }else{
               g.add( (i-1)*c+j,T,a );
           }
       }
   }
   int ans = sum - g.max_flow(S,T);
   printf("%d\n",ans);
   return 0;
}