Cow Bowling
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 13278 | Accepted: 8772 |
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:
【思路】
简单dp,主要还是锻炼动态规划的思维。
dp[i][j]表示第i行第j列的最大路线。
dp[i][j] = dp[i][j] = max(dp[i-1][j-1],dp[i-1][j]) + m[i][j]; if 不在最左最右
dp[i][j] = dp[i-1][j] + m[i][j]; if 在最左
dp[i][j] = dp[i-1][j-1] + m[i][j]; if在最右
代码一次AC,但是因为不是动态开数组,资源消耗比较大,380ms 的运行时间有待优化
【代码】
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,主要还是锻炼动态规划的思维。
dp[i][j]表示第i行第j列的最大路线。
dp[i][j] = dp[i][j] = max(dp[i-1][j-1],dp[i-1][j]) + m[i][j]; if 不在最左最右
dp[i][j] = dp[i-1][j] + m[i][j]; if 在最左
dp[i][j] = dp[i-1][j-1] + m[i][j]; if在最右
代码一次AC,但是因为不是动态开数组,资源消耗比较大,380ms 的运行时间有待优化
【代码】
#include<iostream>
#include<stack>
#include<iomanip>
#include<string>
int c[2][5001] = {0};
using namespace std;
int main(void){
int n;
int m[351][351] = {0};
int dp[351][351] = {0};
while(cin>>n){
for(int i=1;i<=n;i++){
for(int j=1;j<=i;j++){
cin>>m[i][j];
}
}
dp[1][1] = m[1][1];
for(int i=2;i<=n;i++){
for(int j=1;j<=i;j++){
if(j>=2 && j<=i-1)
dp[i][j] = max(dp[i-1][j-1],dp[i-1][j]) + m[i][j];
else if(j ==1)
dp[i][j] = dp[i-1][j] + m[i][j];
else if(j==i)
dp[i][j] = dp[i-1][j-1] + m[i][j];
}
}
int ans = -19990;
for(int i=1;i<=n;i++)
if(ans < dp[n][i])ans = dp[n][i];
cout<<ans<<endl;
}
}