zoukankan      html  css  js  c++  java
  • 数塔 Medium

    Summer is coming! It's time for Iahub and Iahubina to work out, as they both want to look hot at the beach. The gym where they go is a matrix a with n lines and mcolumns. Let number a[i][j] represents the calories burned by performing workout at the cell of gym in the i-th line and the j-th column.

    Iahub starts with workout located at line 1 and column 1. He needs to finish with workout a[n][m]. After finishing workout a[i][j], he can go to workout a[i + 1][j] or a[i][j + 1]. Similarly, Iahubina starts with workout a[n][1] and she needs to finish with workout a[1][m]. After finishing workout from cell a[i][j], she goes to either a[i][j + 1] or a[i - 1][j].

    There is one additional condition for their training. They have to meet in exactly one cell of gym. At that cell, none of them will work out. They will talk about fast exponentiation (pretty odd small talk) and then both of them will move to the next workout.

    If a workout was done by either Iahub or Iahubina, it counts as total gain. Please plan a workout for Iahub and Iahubina such as total gain to be as big as possible. Note, that Iahub and Iahubina can perform workouts with different speed, so the number of cells that they use to reach meet cell may differs.

    Input

    The first line of the input contains two integers n and m (3 ≤ n, m ≤ 1000). Each of the next n lines contains m integers: j-th number from i-th line denotes element a[i][j] (0 ≤ a[i][j] ≤ 105).

    Output

    The output contains a single number — the maximum total gain possible.

    Example

    Input
    3 3
    100 100 100
    100 1 100
    100 100 100
    Output
    800

    Note

    Iahub will choose exercises a[1][1] → a[1][2] → a[2][2] → a[3][2] → a[3][3]. Iahubina will choose exercises a[3][1] → a[2][1] → a[2][2] → a[2][3] → a[1][3].

    #include<iostream>
    #include<cstring>
    #include<cstdio>
    
    using namespace std;
    const int N = 1000 + 5;
    int mat[N][N], a[N][N], b[N][N], c[N][N], d[N][N];
    
    int main(){
        int n, m;
        scanf("%d %d", &n, &m);
        for(int i = 1; i <= n; i++)
            for(int j = 1; j <= m; j++) scanf("%d", &mat[i][j]);
    
        for(int i = 1; i <= n; i++)
            for(int j = 1; j <= m; j++) a[i][j] = max(a[i-1][j], a[i][j-1]) + mat[i][j];
    
        for(int i = n; i > 0; i--)
            for(int j = m; j > 0; j--)  b[i][j] = max(b[i+1][j], b[i][j+1]) + mat[i][j];
    
        for(int i = n; i > 0; i--)
            for(int j = 1; j <= m; j++) c[i][j] = max(c[i+1][j], c[i][j-1]) + mat[i][j];
    
        for(int i = 1; i <= n; i++)
            for(int j = m; j > 0; j--)  d[i][j] = max(d[i-1][j], d[i][j+1]) + mat[i][j];
        int ans = 0;
        for(int i = 2; i < n; i++)
            for(int j = 2; j < m; j++)
                ans = max(ans, a[i-1][j] + b[i+1][j] + c[i][j-1] + d[i][j+1]),
                ans = max(ans, a[i][j-1] + b[i][j+1] + c[i+1][j] + d[i-1][j]);
        printf("%d
    ", ans);
    }
  • 相关阅读:
    博客园界面部分优化
    jQuery获取Select选择的Text和 Value
    java开发各层对象含义
    接口与抽象类的区别(完整描述)
    Map相关知识总结
    html引用外部js和css
    RDD内存迭代原理(Resilient Distributed Datasets)---弹性分布式数据集
    spark高可用集群搭建及运行测试
    spark集群的简单测试和基础命令的使用
    spark集群搭建
  • 原文地址:https://www.cnblogs.com/Pretty9/p/7406842.html
Copyright © 2011-2022 走看看