zoukankan      html  css  js  c++  java
  • HDU3376 最小费用最大流 模板2

    Matrix Again

    Time Limit: 5000/2000 MS (Java/Others)    Memory Limit: 102400/102400 K (Java/Others)
    Total Submission(s): 4255    Accepted Submission(s): 1233


    Problem Description
    Starvae very like play a number game in the n*n Matrix. A positive integer number is put in each area of the Matrix.
    Every time starvae should to do is that choose a detour which from the top left point to the bottom right point and than back to the top left point with the maximal values of sum integers that area of Matrix starvae choose. But from the top to the bottom can only choose right and down, from the bottom to the top can only choose left and up. And starvae can not pass the same area of the Matrix except the start and end..
    Do you know why call this problem as “Matrix Again”? AS it is like the problem 2686 of HDU.
     
    Input
    The input contains multiple test cases.
    Each case first line given the integer n (2<=n<=600) 
    Then n lines, each line include n positive integers. (<100)
     
    Output
    For each test case output the maximal values starvae can get.
     
    Sample Input
    2 10 3 5 10 3 10 3 3 2 5 3 6 7 10 5 1 2 3 4 5 2 3 4 5 6 3 4 5 6 7 4 5 6 7 8 5 6 7 8 9
     
    Sample Output
    28 46 80
     
    Author
    Starvae
     
    Source
     代码:
    //和HDU2686一样,只是数据变大了,上一个模板会超内存,这个板不会。
    /***********************最小费用最大流模板2*************************/
    #include<iostream>
    #include<cstdio>
    #include<cstring>
    #include<queue>
    using namespace std;
    const int maxn=610*610*2+2;
    const int maxm=4*maxn;//!边数要够
    const int inf=0x7fffffff;
    struct Edge
    {
        int to,next,cap,flow,cost;
    }edges[maxm];
    int head[maxn],tol,pre[maxn],dis[maxn];
    bool vis[maxn];
    int N;
    void init(int n)
    {
        N=n;
        tol=0;
        memset(head,-1,sizeof(head));
    }
    void AddEdge(int u,int v,int cap,int cost)
    {
        edges[tol].to=v;
        edges[tol].cap=cap;
        edges[tol].cost=cost;
        edges[tol].flow=0;
        edges[tol].next=head[u];
        head[u]=tol++;
        edges[tol].to=u;
        edges[tol].cap=0;
        edges[tol].cost=-cost;
        edges[tol].flow=0;
        edges[tol].next=head[v];
        head[v]=tol++;
    }
    bool spfa(int s,int t)
    {
        queue<int>q;
        for(int i=0;i<=N;i++){
            dis[i]=inf;
            vis[i]=0;
            pre[i]=-1;
        }
        dis[s]=0;
        vis[s]=1;
        q.push(s);
        while(!q.empty()){
            int u=q.front();q.pop();
            vis[u]=0;
            for(int i=head[u];i!=-1;i=edges[i].next){
                int v=edges[i].to;
                if(edges[i].cap>edges[i].flow&&dis[v]>dis[u]+edges[i].cost){
                    dis[v]=dis[u]+edges[i].cost;
                    pre[v]=i;
                    if(!vis[v]) {vis[v]=1;q.push(v);}
                }
            }
        }
        if(pre[t]==-1) return 0;
        return 1;
    }
    int MinCostFlow(int s,int t)
    {
        int flow=0,cost=0;
        while(spfa(s,t)){
            int Min=inf;
            for(int i=pre[t];i!=-1;i=pre[edges[i^1].to])
                Min=min(Min,edges[i].cap-edges[i].flow);
            for(int i=pre[t];i!=-1;i=pre[edges[i^1].to]){
                edges[i].flow+=Min;
                edges[i^1].flow-=Min;
                cost+=edges[i].cost*Min;
            }
            flow+=Min;
        }
        return cost;//返回最小费用,flow存最大流
    }
    /*********************************************************************/
    int main()
    {
        int n,mp[605][605];
        while(scanf("%d",&n)==1){
            for(int i=1;i<=n;i++)
                for(int j=1;j<=n;j++) scanf("%d",&mp[i][j]);
            int s=0,t=n*n*2+1;
            init(n*n*2+2);
            for(int i=1;i<=n;i++){
                for(int j=1;j<=n;j++){
                    int id=(i-1)*n+j;
                    if(id==1){
                        AddEdge(id,id+n*n,2,-mp[i][j]);
                        AddEdge(s,id,2,0);
                    }
                    else if(id==n*n){
                        AddEdge(id,id+n*n,2,-mp[i][j]);
                        AddEdge(id+n*n,t,2,0);
                    }
                    else AddEdge(id,id+n*n,1,-mp[i][j]);
                    if(i<n) AddEdge(id+n*n,id+n,1,0);
                    if(j<n) AddEdge(id+n*n,id+1,1,0);
                }
            }
            int ans=-(MinCostFlow(s,t)+mp[1][1]+mp[n][n]);
            printf("%d
    ",ans);
        }
        return 0;
    }
  • 相关阅读:
    java之认识基本数据类型及其封装类装箱和拆箱总结
    java之集合类特性对比分析列表
    <转>泛型的内部原理:类型擦除以及类型擦除带来的问题
    java之集合类框架的简要知识点:泛型的类型擦除
    java之方法覆盖的坑
    java入门概念个人理解之访问修饰符
    blog开篇
    卓越管理的实践技巧(4)如何才能给予有效的反馈 Guide to Giving Effective Feedback
    权限管理系统之组织管理
    卓越管理的实践技巧(3)推动团队管理的要点 Facilitation Essentials for Managers
  • 原文地址:https://www.cnblogs.com/--ZHIYUAN/p/6496876.html
Copyright © 2011-2022 走看看