zoukankan      html  css  js  c++  java
  • HDU 3376 Matrix Again

    Matrix Again

    Time Limit: 2000ms
    Memory Limit: 102400KB
    This problem will be judged on HDU. Original ID: 3376
    64-bit integer IO format: %I64d      Java class name: Main
    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

    Source

     
    解题:费用流
     1 #include <bits/stdc++.h>
     2 using namespace std;
     3 const int INF = 0x3f3f3f3f;
     4 const int maxn = 601*602*2;
     5 struct arc {
     6     int to,flow,cost,next;
     7     arc(int x = 0,int y = 0,int z = 0,int nxt = -1) {
     8         to = x;
     9         flow = y;
    10         cost = z;
    11         next = nxt;
    12     }
    13 } e[3000010];
    14 int head[maxn],d[maxn],p[maxn],tot,S,T;
    15 bool in[maxn];
    16 void add(int u,int v,int flow,int cost) {
    17     e[tot] = arc(v,flow,cost,head[u]);
    18     head[u] = tot++;
    19     e[tot] = arc(u,0,-cost,head[v]);
    20     head[v] = tot++;
    21 }
    22 bool spfa() {
    23     memset(in,false,sizeof in);
    24     memset(d,-1,sizeof d);
    25     memset(p,-1,sizeof p);
    26     queue<int>q;
    27     d[S] = 0;
    28     q.push(S);
    29     while(!q.empty()) {
    30         int u = q.front();
    31         q.pop();
    32         in[u] = false;
    33         for(int i = head[u]; ~i; i = e[i].next) {
    34             if(e[i].flow && d[e[i].to] < d[u] + e[i].cost) {
    35                 d[e[i].to] = d[u] + e[i].cost;
    36                 p[e[i].to] = i;
    37                 if(!in[e[i].to]) {
    38                     in[e[i].to] = true;
    39                     q.push(e[i].to);
    40                 }
    41             }
    42         }
    43     }
    44     return p[T] > -1;
    45 }
    46 int solve(int ret = 0) {
    47     while(spfa()) {
    48         int mh = 1;
    49         //for(int i = p[T]; ~i; i = p[e[i^1].to])
    50             //mh = min(mh,e[i].flow);
    51         for(int i = p[T]; ~i; i = p[e[i^1].to]) {
    52             e[i].flow -= mh;
    53             e[i^1].flow += mh;
    54         }
    55         ret += mh*d[T];
    56     }
    57     return ret;
    58 }
    59 int main() {
    60     int n;
    61     while(~scanf("%d",&n)) {
    62         memset(head,-1,sizeof head);
    63         int ret = tot = 0;
    64         for(int i = 1; i <= n; ++i)
    65             for(int j = 1,val; j <= n; ++j) {
    66                 scanf("%d",&val);
    67                 int u = (i-1)*n + j,v = u + n*n;
    68                 if(u == 1 || u == n*n) {
    69                     add(u,v,2,val);
    70                     ret -= val;
    71                 } else add(u,v,1,val);
    72                 if(i < n) add(v,u + n,1,0);
    73                 if(j < n) add(v,u + 1,1,0);
    74             }
    75         S = 1;
    76         T = 2*n*n;
    77         printf("%d
    ",solve() + ret);
    78     }
    79     return 0;
    80 }
    View Code
  • 相关阅读:
    webclassify 用于网页分类的python工具包
    基于Web 开发模式的信息抽取
    携梦远行 » curl 抓取跳转内容
    CharField cannot have a "max_length" greater than 255 when using "unique=True" Google Groups
    并发编程利器Eventlet
    ANSI colored Python logging — Gist
    Fabulous — fabulous v0.1.5 documentation
    让你的博客支持MetaWeblog离线发布_维护记录 站点功能_DangJian's Blog
    Plumber Jack: Colourising logging output in terminals
    ajax客户端与服务端传输字符串
  • 原文地址:https://www.cnblogs.com/crackpotisback/p/4945129.html
Copyright © 2011-2022 走看看