bzoj2132（最小割经典例题）

这种方格的题目，我们最容易想到二分图，最大流等等

注意，一对相邻格子如果不相同，所获得的利益应该是两个格子的c之和！！这里wa了一次

（具体在本子上）

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<algorithm>
#include<queue>
#include<iostream>
using namespace std;
const int inf=0x3f3f3f3f;
const int qx[]={0,0,-1,1};
const int qy[]={1,-1,0,0};
int n,m,id[105][105],s,t;
int head[10050],cur[10050],tot,lev[10050];
struct aa
{
	int to,pre,flow,cap;
}edge[505000];
void addedge(int x,int y,int z)
{
	edge[++tot].to=y;edge[tot].cap=z;edge[tot].pre=head[x];head[x]=tot;
	edge[++tot].to=x;edge[tot].cap=0;edge[tot].pre=head[y];head[y]=tot;
}
bool bfs()
{
	memset(lev,0,sizeof(lev));
	lev[s]=1;queue<int> q;q.push(s);
	while (!q.empty())
	{
		int u=q.front();q.pop();
		for (int i=head[u];i;i=edge[i].pre)
		if (edge[i].cap>edge[i].flow&&!lev[edge[i].to])
		{
			lev[edge[i].to]=lev[u]+1;
			if (edge[i].to==t) return true;
			q.push(edge[i].to);
		}
	}
	return false;
}
int dfs(int u,int maxflow)
{
	if (u==t||maxflow==0) return maxflow;
	int ans=0;
	for (int &i=cur[u];i;i=edge[i].pre)
	if (lev[edge[i].to]==lev[u]+1)
	{
		int flow=dfs(edge[i].to,min(maxflow,edge[i].cap-edge[i].flow));
		ans+=flow;
		maxflow-=flow;
		edge[i].flow+=flow;
		edge[((i-1)^1)+1].flow-=flow;
		if (maxflow==0) return ans;
	}
	return ans;
}
int work()
{
	int ans=0;
	while (bfs())
	{
		for (int i=s;i<=t;i++) cur[i]=head[i];
		ans+=dfs(s,inf);
	}
	return ans;
}
int main()
{
	scanf("%d%d",&n,&m);
	int x,bj=0,total=0;
	for (int i=1;i<=n;i++)
		for (int j=1;j<=m;j++) id[i][j]=++bj;
	x=0,t=bj+1;
	for (int i=1;i<=n;i++)
		for (int j=1;j<=m;j++)
		{
			scanf("%d",&x);total+=x;
			if ((i+j)&1) addedge(s,id[i][j],x);
			else addedge(id[i][j],t,x); 	
		}
	for (int i=1;i<=n;i++)
		for (int j=1;j<=m;j++) 
		{
			scanf("%d",&x);total+=x;
			if ((i+j)&1) addedge(id[i][j],t,x);
			else addedge(s,id[i][j],x);
		}
	for (int i=1;i<=n;i++)
		for (int j=1;j<=m;j++)
		{
			scanf("%d",&x);
			for (int l=0;l<4;l++)
			if (id[i+qx[l]][j+qy[l]])
			{
				total+=x;
				addedge(id[i][j],id[i+qx[l]][j+qy[l]],x);
				addedge(id[i+qx[l]][j+qy[l]],id[i][j],x);//这里应该双向连边，其实就等价于连了一条c【i】【j】+c【i+qx】【j+qy】的边，只不过需要记录c，这样简便一些
			}
		}
	printf("%d",total-work());
	return 0;
}