zoukankan      html  css  js  c++  java
  • 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
    
  • 相关阅读:
    Maven学习
    Oracle_SQL函数-单行函数
    Java 8新特性-5 内建函数式接口
    量子优势
    配置Emeditor编译运行JAVA,附私家珍藏版
    配置Emeditor编译运行JAVA,附私家珍藏版
    Notepad2-mod,轻量级文本编辑器、代替记事本的最佳选择
    三星S7短信不能提示的处理方法
    三星S7短信不能提示的处理方法
    说说宾得机身的十大人性化设定和功能[转]
  • 原文地址:https://www.cnblogs.com/neighthorn/p/6159817.html
Copyright © 2011-2022 走看看