• HOJ 2713 Matrix1


    Matrix1

    My Tags   (Edit)
      Source : Classical Problem
      Time limit : 5 sec   Memory limit : 64 M

    Submitted : 424, Accepted : 129

    Lilu0355 is a thoughtful boy and always plays a classical mathematic game.The game plays like that, there is a n * m matrix, each grid of this matrix is filled with a non-negative number. You should remove some numbers from the matrix and make sure that any two numbers removed are not adjacent in the matrix. What is the biggest sum of those removed numbers? Lilu can always find the answer, can you?

    Input

    The first line is a integer T indicating the number of test cases.T cases fllows. Each case includs two integers n, m(m ≤ 50,n ≤ 50) and n * m non-negative integers, which is not more than 40000.

    Output

    For each test case, output the biggest sum.

    Sample Input

    1
    3 2
    180 25
    210 45
    220 100
    

    Sample Output

    445
    
  • 相关阅读:
    [k8s] minikube的使用与应用部署
    [docker]docker 安装及构建流程
    [npm] error Cannot read properties of null (reading 'pickAlgorithm')
    SpringWebflux中WebClient怎么打印日志
    ERROR: cannot verify xxx certificate, issued by ‘/C=US/O=Let’s Encrypt/CN=R3’:use `nocheckcertif`
    如何解压 rpm 文件
    error while loading shared libraries: libmpfr.so.6: cannot open shared object file
    安装`gmp`遇到 configure:error:no usable m4 in$path or /user/5bin解决方案
    gcc升级
    264. 丑数 II (JAVA)
  • 原文地址:https://www.cnblogs.com/neighthorn/p/6159817.html
Copyright © 2020-2023  润新知