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
    
  • 相关阅读:
    Java课程设计-计算器 丁树乐(201521123024)
    201521123024 《Java程序设计》第13周学习总结
    201521123024 《java程序设计》 第12周学习总结
    201521123024 《Java程序设计》第11周学习总结
    201521123024 java 第十周学习总结
    软工个人作业5-软件工程总结
    软工个人作业3案例分析
    结对编程练习
    软件工程网络15个人阅读2
    软工网络15个人阅读作业1
  • 原文地址:https://www.cnblogs.com/neighthorn/p/6159817.html
Copyright © 2011-2022 走看看