Cow Bowling
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 17897 | Accepted: 11910 |
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:
Given a triangle with N (1 <= N <= 350) rows, determine the highest possible sum achievable.
7 3 8 8 1 0 2 7 4 4 4 5 2 6 5Then 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.
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 5The highest score is achievable by traversing the cows as shown above.
----------------------------------------------------------
用dp[i][j]表示到i行j列处所得的sum最大值;
原先的想法是从上往下推,dp[i][j] = max(dp[i-1][j],dp[i-1][j-1])+w[i][j],过程中考虑边界情况;最后从dp[i]行中选取最大值即可。
后来改为从下往上推更为简单,dp[i][j] = max(dp[i+1][j],dp[i+1][j+1]),并且没有边界情况,最后的结果为dp[0][0]为最大值。
<span style="font-size:14px;">/*
* Filename: code.cpp
* Created: 2016-10-11
*[mail:17744454343@163.com]
* Desciption: Desciption
*/
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <stack>
#include <queue>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <vector>
#include <bitset>
#include <list>
#include <sstream>
#include <set>
#include <functional>
using namespace std;
#define INT_MAX 1 << 30
#define MAX 100
typedef long long ll;
int n;
int dp[400][400];
int w[400][400];
void solve()
{
for (int i = 0; i < n; i += 1){
dp[n-1][i] = w[n-1][i];
}
for (int i = n-2; i >= 0; i -= 1){
for (int j = 0; j <= i; j += 1){
dp[i][j] = max(dp[i+1][j],dp[i+1][j+1])+w[i][j];
}
}
printf("%d\n",dp[0][0]);
}
int main(int argc, char const* argv[])
{
scanf("%d",&n);
for (int i = 0; i < n; i += 1){
for (int j = 0; j <= i; j += 1){
scanf("%d",&w[i][j]);
}
}
solve();
return 0;
}<span style="color:#0000ff;">
</span></span><span style="color: blue; font-size: 18pt;">
</span>