POJ-3176 Cow Bowling
阿新 • • 發佈：2018-08-20
efault tar rsa when def represent amp tin n+1
Language:
Cow Bowling
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 Given a triangle with N (1 <= N <= 350) rows, determine the highest possible sum achievable. Input 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 rulesSample 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 |
//遞推一下就好了，想一下這一步是怎麽來的就出來遞推式了
#include<stdio.h> #include<algorithm> #include<iostream> using namespace std; int n,map[1000][1000],dp[1000][1000]; int ans=0; int main() { cin>>n; for(int i=1;i<=n;i++) { for(int j=1;j<=i;j++) { cin>>map[i][j]; } } int i,j; for(i=1;i<=n;i++) { for(j=1;j<=i;j++) { dp[i][j]=max(dp[i-1][j],dp[i-1][j-1])+map[i][j]; ans=max(ans,dp[i][j]); } } cout<<ans; }
POJ-3176 Cow Bowling