POJ 2948 DP

Martian Mining
Time Limit: 5000MS Memory Limit: 65536K
Total Submissions: 2535 Accepted: 1573
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

题意：

有一个矿产，每个位置有两种矿。一种矿需要运到最上方，另一种需要运到最左方。每个位置可以放置两种传送带中的一种：一种向上的一种向左的。问最后的能最多收集到多少的矿物。

题解：

定义dp[i][j]为从（0，0）到（i，j）能收集到的最多的矿物，那么可以知道，下一步要么是添加了右边的一列让其都运到最上面，或者是添加下边一行让其都运送到左边。这每一步添加都是没有后继性的。然后就可以把所有的位置都递推出来。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <stack>
#include <string>
#include <set>
#include <cmath>
#include <map>
#include <queue>
#include <sstream>
#include <vector>
#include <iomanip>
#define m0(a) memset(a,0,sizeof(a))
#define mm(a) memset(a,0x3f,sizeof(a))
#define m_1(a) memset(a,-1,sizeof(a))
#define f(i,a,b) for(i = a;i<=b;i++)
#define fi(i,a,b) for(i = a;i>=b;i--)
#define lowbit(a) ((a)&(-a))
#define FFR freopen("data.in","r",stdin)
#define FFW freopen("data.out","w",stdout)
#define INF 0x3f3f3f3f
typedef long long ll;
typedef long double ld;
const ld PI = acos(-1.0);

using namespace std;
#define SIZE ( 550)
int costw[SIZE][SIZE];
int costn[SIZE][SIZE];
int sumn[SIZE][SIZE];
int sumw[SIZE][SIZE];
int dp[SIZE][SIZE];

int main()
{
    //ios_base::sync_with_stdio(false); cin.tie(0);
    int n, m;
    while (scanf("%d%d",&n,&m)&& (n || m))
    {
        int i, j;
        m0(sumw);
        m0(sumn);
        f(i, 1, n)
            f(j, 1, m) {
                scanf("%d", &costw[i][j]);
                //cin >> costw[i][j];
                sumw[i][j] = sumw[i][j - 1] + costw[i][j];
            }

        f(i, 1, n)
            f(j, 1, m) {
                //cin >> costn[i][j];
                scanf("%d", &costn[i][j]);
                sumn[i][j] = sumn[i - 1][j] + costn[i][j];
            }
        m0(dp);
        f(i, 1, n)
            f(j, 1, m){
                dp[i][j] = max(dp[i][j - 1] + sumn[i][j], dp[i - 1][j] + sumw[i][j]);
            }
        printf("%d\n", dp[n][m]);
    }
    return 0;
}