POJ 2948 Martian Mining(简单的二维dp)

题目不难但是首先你得读懂题目啊、、

火星上有yeyenum bloggium两种矿石，bloggium只能南北方向运送到最北端，yeyenum只能东西方向运送到最西端。如果这个方格已经建立了东西方向的传送带，则不能再建立南北方向的传送带。已知yeyenum和bloggium的在棋盘上的分布，求运送的最北端和最西端的最大运送量。。。

dp[i][j] 表示第i行和第j列的最大值。需要预处理出来[i,j]区间内两种矿石的个数。dp[x][y]表示(1, 1)到(x, y)所包含的区间可以确定的最大矿石数，dp[x][y] = max(dp[x-1][y] + sum[0][x][y], dp[x][y-1] + sum[1][x][y]);

Martian Mining

Time Limit: 5000MS		Memory Limit: 65536K
Total Submissions: 2357		Accepted: 1442

Description

The NASA Space Center, Houston, is less than 200 miles from San Antonio, Texas (the site of the ACM Finals this year). This is the place where the astronauts are trained for Mission Seven Dwarfs, the next giant leap in space exploration. The Mars Odyssey program revealed that the surface of Mars is very rich in yeyenum and bloggium. These minerals are important ingredients for certain revolutionary new medicines, but they are extremely rare on Earth. The aim of Mission Seven Dwarfs is to mine these minerals on Mars and bring them back to Earth. 

The Mars Odyssey orbiter identified a rectangular area on the surface of Mars that is rich in minerals. The area is divided into cells that form a matrix of n rows and m columns, where the rows go from east to west and the columns go from north to south. The orbiter determined the amount of yeyenum and bloggium in each cell. The astronauts will build a yeyenum refinement factory west of the rectangular area and a bloggium factory to the north. Your task is to design the conveyor belt system that will allow them to mine the largest amount of minerals. 

There are two types of conveyor belts: the first moves minerals from east to west, the second moves minerals from south to north. In each cell you can build either type of conveyor belt, but you cannot build both of them in the same cell. If two conveyor belts of the same type are next to each other, then they can be connected. For example, the bloggium mined at a cell can be transported to the bloggium refinement factory via a series of south-north conveyor belts. 

The minerals are very unstable, thus they have to be brought to the factories on a straight path without any turns. This means that if there is a south-north conveyor belt in a cell, but the cell north of it contains an east-west conveyor belt, then any mineral transported on the south-north conveyor beltwill be lost. The minerals mined in a particular cell have to be put on a conveyor belt immediately, in the same cell (thus they cannot start the transportation in an adjacent cell). Furthermore, any bloggium transported to the yeyenum refinement factory will be lost, and vice versa. 
 
Your program has to design a conveyor belt system that maximizes the total amount of minerals mined,i.e., the sum of the amount of yeyenum transported to the yeyenum refinery and the amount of bloggium transported to the bloggium refinery.

Input

The input contains several blocks of test cases. Each case begins with a line containing two integers: the number 1 ≤ n ≤ 500 of rows, and the number 1 ≤ m ≤ 500 of columns. The next n lines describe the amount of yeyenum that can be found in the cells. Each of these n lines contains m integers. The first line corresponds to the northernmost row; the first integer of each line corresponds to the westernmost cell of the row. The integers are between 0 and 1000. The next n lines describe in a similar fashion theamount of bloggium found in the cells. 

The input is terminated by a block with n = m = 0.

Output

For each test case, you have to output a single integer on a separate line: the maximum amount of mineralsthat can be mined.

Sample Input

4 4
0 0 10 9
1 3 10 0
4 2 1 3 
1 1 20 0
10 0 0 0
1 1 1 30
0 0 5 5
5 10 10 10
0 0

Sample Output

98

#include <algorithm>
#include <iostream>
#include <stdlib.h>
#include <string.h>
#include <iomanip>
#include <stdio.h>
#include <string>
#include <queue>
#include <cmath>
#include <stack>
#include <map>
#include <set>
#define eps 1e-8
#define M 1000100
//#define LL __int64
#define LL long long
#define INF 0x7f3f3ff
#define PI 3.1415926535898


const int maxn = 1010;

using namespace std;

LL dp[maxn][maxn];
LL sum[2][maxn][maxn];
int mp1[maxn][maxn];
int mp2[maxn][maxn];

int main()
{
    int n, m;
    while(cin >>n>>m)
    {
        if(!n && !m)
            break;
        for(int i = 0; i <= n; i++)
        {
            for(int j = 0; j <= m; j++)
            {
                sum[0][i][j] = sum[1][i][j] = 0;
                dp[i][j] = 0;
            }
        }
        for(int i = 1; i <= n; i++)
        {
            for(int j = 1; j <= m; j++)
            {
                scanf("%d",&mp1[i][j]);
                sum[0][i][j] = sum[0][i][j-1]+mp1[i][j];
            }
        }
        for(int i = 1; i <= n; i++)
        {
            for(int j = 1; j <= m; j++)
            {
                scanf("%d",&mp2[i][j]);
                sum[1][i][j] = sum[1][i-1][j]+mp2[i][j];
            }
        }

        for(int i = 1; i <= n; i++)
        {
            for(int j = 1; j <= m; j++)
            {
                dp[i][j] = max(dp[i-1][j]+sum[0][i][j], dp[i][j-1]+sum[1][i][j]);
            }
        }
        cout<<dp[n][m]<<endl;
    }
    return 0;
}