Description
Input
Output
Sample Input
Sample Output
Hint
Description
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
Lines 2..N+1: Line i+1 contains i space-separated integers that represent row i of the triangle.
Output
Sample Input
5
7
3 8
8 1 0
2 7 4 4
4 5 2 6 5
Sample Output
30
Hint
7
*
3 8
*
8 1 0
*
2 7 4 4
*
4 5 2 6 5
#include <iostream>
#include <cstdio>
#include <queue>
#include <vector>
#include <map>
#include <cmath>
#include <algorithm>
using namespace std;
int main()
{
int n;
cin >> n;
long long m[400][400] = { 0 };
int i, j;
for( i=1; i<=n; i++ )
{
for( j=1; j<=i; j++ )
{
cin >> m[i][j];
}
}
for( i=n-1; i>0; i-- )
{
for( j=1; j<=i; j++)
{
m[i][j] += max( m[i+1][j], m[i+1][j+1] );
}
}
cout << m[1][1] <<endl;
return 0;
}