hdu 2686 Matrix hdu 3376 Matrix Again 费用流

两道题目十分类似，只是数据量问题，都可以用费用流来解，所以只贴前一道题的代码了，从右下往左上等效从左上往右下，因此即相当于走两次，建图方式同poj 

3422。

#include <stdio.h>
#include <iostream>
#include <string.h>
using namespace std;
const int N=2000;
const int MAXE=200000;
const int inf=1<<30;
int head[N],s,t,cnt,n,m,ans;
int d[N],pre[N];
bool vis[N];
int q[MAXE];
struct Edge
{
    int u,v,c,w,next;
}edge[MAXE];

void addedge(int u,int v,int w,int c)
{
    edge[cnt].u=u;
    edge[cnt].v=v;
    edge[cnt].w=w;
    edge[cnt].c=c;
    edge[cnt].next=head[u];
    head[u]=cnt++;
    edge[cnt].v=u;
    edge[cnt].u=v;
    edge[cnt].w=-w;
    edge[cnt].c=0;
    edge[cnt].next=head[v];
    head[v]=cnt++;
}

int SPFA()
{
    int l,r;
    memset(pre,-1,sizeof(pre));
    memset(vis,0,sizeof(vis));
    for(int i=0;i<=t;i++) d[i]=inf;
    d[s]=0;
    l=0;r=0;
    q[r++]=s;
    vis[s]=1;
    while(l<r)
    {
        int u=q[l++];
        vis[u]=0;
        for(int j=head[u];j!=-1;j=edge[j].next)
        {
            int v=edge[j].v;
            if(edge[j].c>0&&d[u]+edge[j].w<d[v])
            {
                d[v]=d[u]+edge[j].w;
                pre[v]=j;
                if(!vis[v])
                {
                    vis[v]=1;
                    q[r++]=v;
                }
            }
        }
    }
    if(d[t]==inf)
        return 0;
    return 1;
}

void MCMF()
{
    int flow=0;
    while(SPFA())
    {
        ans+=d[t];
        int u=t;
        int mini=inf;
        while(u!=s)
        {
            if(edge[pre[u]].c<mini)
                mini=edge[pre[u]].c;
                u=edge[pre[u]].u;
        }
        flow+=mini;
        u=t;
        while(u!=s)
        {
            edge[pre[u]].c-=mini;
            edge[pre[u]^1].c+=mini;
            u=edge[pre[u]].u;
        }
    }
}

int main()
{
    while(scanf("%d",&n)!=EOF)
    {
        int map[50][50];
        int i,j;              
        for(i=1;i<=n;i++)
            for(j=1;j<=n;j++)
                scanf("%d",&map[i][j]);
        s=0;t=2*n*n+1;cnt=0;
        for(i=0;i<=t;i++)
            head[i]=-1;
        for(i=1;i<=n;i++)
            for(j=1;j<=n;j++)
            {
                addedge(j+(i-1)*n,n*n+j+(i-1)*n,-map[i][j],1);  
                int u,v,cost;
                u=(i-1)*n+j;
                if(i+1<=n)
                {
                    v=i*n+j;
                    addedge(u+n*n,v,0,inf);
                }
                if(j+1<=n)
                {
                    v=(i-1)*n+j+1;
                    addedge(u+n*n,v,0,inf);
                }
            }
        addedge(0,1,0,2);
        addedge(1,1+n*n,0,inf);
        addedge(2*n*n,t,0,2);
        addedge(n*n,n*n+n*n,0,inf);
        ans=0;
        MCMF();
        printf("%d\n",-ans);
    }
    return 0;
}

 

 

 

转载于:https://www.cnblogs.com/vermouth/p/3710172.html