用最大流解决棋盘类问题的时候,首先要对棋盘进行黑白染色,使得任意两个相邻的格子颜色不一样。
1.白色格子向源点连一条边,黑色格子向汇点连一条边,权值是该格子的值
2.每个白色格子向相邻的黑色格子连一条边,权值INF。
之后求最大点权独立集。千万不要让黑色格子也和白色格子连边,一开始就是这里出了错……
#include <cstdio>
#include <iostream>
#include <cstring>
#include <vector>
#include <algorithm>
using namespace std;
const int MAXN = 1000100;//点数的最大值
const int MAXM = 4000100;//边数的最大值
const int INF = 0x3f3f3f3f;
struct Edge
{
int to,next,cap,flow,from;
} edge[MAXM]; //注意是MAXM
int tol;
int head[MAXN];
int gap[MAXN],dep[MAXN],cur[MAXN];
void init()
{
tol = 0;
memset(head,-1,sizeof(head));
}
void addedge(int u,int v,int w,int rw = 0)
{
edge[tol].to = v;
edge[tol].from = u;
edge[tol].cap = w;
edge[tol].flow = 0;
edge[tol].next = head[u];
head[u] = tol++;
edge[tol].to = u;
edge[u].from = v;
edge[tol].cap = rw;
edge[tol].flow = 0;
edge[tol].next = head[v];
head[v] = tol++;
}
int Q[MAXN];
void BFS(int start,int end)
{
memset(dep,-1,sizeof(dep));
memset(gap,0,sizeof(gap));
gap[0] = 1;
int front = 0, rear = 0;
dep[end] = 0;
Q[rear++] = end;
while(front != rear)
{
int u = Q[front++];
for(int i = head[u]; i != -1; i = edge[i].next)
{
int v = edge[i].to;
if(dep[v] != -1)
continue;
Q[rear++] = v;
dep[v] = dep[u] + 1;
gap[dep[v]]++;
}
}
}
int S[MAXN];
int sap(int start,int end,int N)
{
BFS(start,end);
memcpy(cur,head,sizeof(head));
int top = 0;
int u = start;
int ans = 0;
while(dep[start] < N)
{
if(u == end)
{
int Min = INF;
int inser;
for(int i = 0; i < top; i++)
if(Min > edge[S[i]].cap - edge[S[i]].flow)
{
Min = edge[S[i]].cap - edge[S[i]].flow;
inser = i;
}
for(int i = 0; i < top; i++)
{
edge[S[i]].flow += Min;
edge[S[i]^1].flow -= Min;
}
ans += Min;
top = inser;
u = edge[S[top]^1].to;
continue;
}
bool flag = false;
int v;
for(int i = cur[u]; i != -1; i = edge[i].next)
{
v = edge[i].to;
if(edge[i].cap - edge[i].flow && dep[v]+1 == dep[u])
{
flag = true;
cur[u] = i;
break;
}
}
if(flag)
{
S[top++] = cur[u];
u = v;
continue;
}
int Min = N;
for(int i = head[u]; i != -1; i = edge[i].next)
if(edge[i].cap - edge[i].flow && dep[edge[i].to] < Min)
{
Min = dep[edge[i].to];
cur[u] = i;
}
gap[dep[u]]--;
if(!gap[dep[u]])
return ans;
dep[u] = Min + 1;
gap[dep[u]]++;
if(u != start)
u = edge[S[--top]^1].to;
}
return ans;
}
void print_all_edges(int n)
{
for(int i = 1;i<=n;i++)
{
for(int j = head[i];j != -1 ;j = edge[j].next)
{
printf("%d -> %d : cap = %d flow = %d\n",edge[j].from,edge[j].to,edge[j].cap,edge[j].flow);
}
}
}
int color[1001][1001];
int num[1001][1001];
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
int main()
{
int n,m;
int sum = 0;
scanf("%d%d",&n,&m);
init();
for(int i = 1;i<=n;i++)
{
for(int j = 1;j<=m;j++)
{
scanf("%d",& num[i][j]);
sum += num[i][j];
if((i + j ) % 2 == 0)
{
addedge(0,(i-1)*m + j,num[i][j]);
if(i > 1) addedge((i - 1)*m + j,(i-2)*m + j,INF);
if(i < n) addedge((i - 1)*m + j,(i)*m + j,INF);
if(j > 1) addedge((i - 1)*m + j,(i-1)*m +(j-1),INF);
if(j <m) addedge((i - 1)*m + j,(i-1)*m +(j+1),INF);
}
else
{
addedge((i-1)*m + j,100000,num[i][j]);
}
}
}
int ans = sap(0,100000,100000+n*m);
// print_all_edges(n*m+1);
printf("%d",sum - ans);
return 0;
}