Cow Bowling
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 14397 | Accepted: 9567 |
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 44 5 2 6 5
从下往上找,每一个三角形的定点可由两个角加上顶点的值 两种方式得到 ,用dp数组保存下最大值即可
#include <iostream> #include <cstdio> #include <cstring> #include <stdlib.h> using namespace std; const int N = 361; int dp[N][N]; int a[N][N]; int main() { int n; while(~scanf("%d",&n)) { memset(dp,0,sizeof(dp)); for(int i=1;i<=n;i++) for(int j=1;j<=i;j++) scanf("%d",&a[i][j]); for(int i=1;i<=n;i++) dp[n][i]=a[n][i]; for(int i=n;i>=1;i--) for(int j=1;j<i;j++) { if(dp[i][j]>dp[i][j+1]) dp[i-1][j]=dp[i][j]+a[i-1][j]; else dp[i-1][j]=dp[i][j+1]+a[i-1][j]; } printf("%d\n",dp[1][1]); } return 0; }