POJ 3176 Cow Bowling （dp）

Cow Bowling

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 14627		Accepted: 9724

Description

The cows don't use actual bowling balls when they go bowling. They each take a number (in the range 0..99), though, and line up in a standard bowling-pin-like triangle like this: 

          7



        3   8



      8   1   0



    2   7   4   4



  4   5   2   6   5

Then the other cows traverse the triangle starting from its tip and moving "down" to one of the two diagonally adjacent cows until the "bottom" row is reached. The cow's score is the sum of the numbers of the cows visited along the way. The cow with the highest score wins that frame. 

Given a triangle with N (1 <= N <= 350) rows, determine the highest possible sum achievable.

Input

Line 1: A single integer, N 

Lines 2..N+1: Line i+1 contains i space-separated integers that represent row i of the triangle.

Output

Line 1: The largest sum achievable using the traversal rules

Sample Input

5
7
3 8
8 1 0
2 7 4 4
4 5 2 6 5

Sample Output

30

Hint

Explanation of the sample: 

          7

         *

        3   8

       *

      8   1   0

       *

    2   7   4   4

       *

  4   5   2   6   5

The highest score is achievable by traversing the cows as shown above.

裸的数塔题 - - 从下往上的姿势比较好 还不用考虑边界

AC代码如下：

//
//  POJ 3176 Cow Bowling
//
//  Created by TaoSama on 2015-03-03
//  Copyright (c) 2015 TaoSama. All rights reserved.
//
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <set>
#include <vector>
#define CLR(x,y) memset(x, y, sizeof(x))

using namespace std;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const int N = 1e5 + 10;

int n, a[400][400], dp[400][400];

int main() {
#ifdef LOCAL
	freopen("in.txt", "r", stdin);
//	freopen("out.txt","w",stdout);
#endif
	ios_base::sync_with_stdio(0);

	while(cin >> n) {
		memset(dp, 0, sizeof dp);
		for(int i = 1; i <= n; ++i) {
			for(int j = 1; j <= i; ++j) {
				cin >> a[i][j];
				if(i == n) dp[i][j] = a[i][j];
			}
		}
		for(int i = n - 1; i >= 1; --i) {
			for(int j = 1; j <= i; ++j) {
				dp[i][j] = max(dp[i+1][j],dp[i+1][j+1]) + a[i][j];
//				printf("dp[%d][%d]: %d\n",i,j,dp[i][j]);
			}
		}
		cout<<dp[1][1]<<endl;
	}
	return 0;
}