https://www.luogu.org/problem/P4013
思路:网络流模拟即可。
细节:n+m<=40而不是20,要开够点。
#include<bits/stdc++.h>
using namespace std;
const int maxn=10000+100;
const int INF=0x3f3f3f3f;
typedef long long ll;
struct Edge{
int from,to,cap,flow,cost;
};
struct MCMF{
int n0,n,m,s,t;
vector<Edge> edges;
vector<int> G[maxn];
int inq[maxn];
ll d[maxn];
int p[maxn];
int a[maxn];
int val[25][50];
void init()
{
s=0,t=1;
cin>>n0>>n;
int num=n0-1;
for(int i=1;i<=n;i++)
{
num++;
for(int j=1;j<=num;j++)
{
cin>>val[i][j];
if(i==1)AddEdge(s,(50*i+j)*2,1,0);
if(i==n)AddEdge((50*i+j)*2+1,t,INF,0);
AddEdge((50*i+j)*2,(50*i+j)*2+1,1,-val[i][j]);
if(i!=1&&j!=1)AddEdge((50*(i-1)+j-1)*2+1,(50*i+j)*2,1,0);
if(i!=1&&j!=num)AddEdge((50*(i-1)+j)*2+1,(50*i+j)*2,1,0);
}
}
}
void init3()
{
for(int i=0;i<m;i++)edges[i].flow=0;
int num=n0-1;
for(int i=1;i<=n;i++)
{
num++;
for(int j=1;j<=num;j++)
{
if(i!=1&&j!=1)AddEdge((50*(i-1)+j-1)*2+1,(50*i+j)*2,INF,0);
if(i!=1&&j!=num)AddEdge((50*(i-1)+j)*2+1,(50*i+j)*2,INF,0);
}
}
}
void init2()
{
for(int i=0;i<m;i++)edges[i].flow=0;
int num=n0-1;
for(int i=1;i<=n;i++)
{
num++;
for(int j=1;j<=num;j++)AddEdge((50*i+j)*2,(50*i+j)*2+1,INF,-val[i][j]);
}
}
void AddEdge(int from,int to,int cap,int cost)
{
edges.push_back((Edge){from,to,cap,0,cost});
edges.push_back((Edge){to,from,0,0,-cost});
m=edges.size();
G[from].push_back(m-2);
G[to].push_back(m-1);
}
bool BellmanFord(ll& flow,ll& cost)
{
for(int i=0;i<maxn;i++)d[i]=(1LL<<50);/***切记这里要改***/
memset(inq,0,sizeof(inq));
d[s]=0;inq[s]=1;p[s]=0;a[s]=INF;
queue<int> Q;
Q.push(s);
while(!Q.empty())
{
int u=Q.front();Q.pop();
inq[u]=0;
for(int i=0;i<G[u].size();i++)
{
Edge& e=edges[G[u][i]];
if(e.cap>e.flow && d[e.to]>d[u]+e.cost)
{
d[e.to]=d[u]+e.cost;
p[e.to]=G[u][i];
a[e.to]=min(a[u],e.cap-e.flow);
if(inq[e.to]==0){inq[e.to]=1;Q.push(e.to);}
}
}
}
if(d[t]==(1LL<<50))return false;
flow+=a[t];
cost+=a[t]*d[t];
int u=t;
while(u!=s)
{
edges[p[u]].flow+=a[t];
edges[p[u]^1].flow-=a[t];
u=edges[p[u]].from;
}
return true;
}
ll Mincost()
{
ll flow=0,cost=0;
while(BellmanFord(flow,cost));
return cost;
}
}ans;
int main()
{
//freopen("input.in","r",stdin);
ans.init();
cout<<-ans.Mincost()<<endl;
ans.init2();
cout<<-ans.Mincost()<<endl;
ans.init3();
cout<<-ans.Mincost()<<endl;
return 0;
}