【hihocoder】#1037 : 数字三角形

题目链接

题目思路

代码如下

#include <iostream>

using namespace std;

int solve(int **triangle,int n)
{
int result;
int **dp =new int*
;
for(int i=0;i<n;i++)
dp[i] = new int
;

for(int i=n-1;i>=0;i--)
for(int j=0;j<=i;j++)
if(i==n-1)
dp[i][j]=triangle[i][j];
else
dp[i][j]=max(dp[i+1][j],dp[i+1][j+1])+triangle[i][j];

result =dp[0][0];
for(int i=0;i<n;i++)
delete[] dp[i];
delete[]dp;

return result;

}

int main()
{
int n;
cin>>n;
int **triangle = new int*
;

for(int i=0;i<n;i++)
triangle[i] = new int
;

for(int i=0;i<n;i++)
for(int j=0;j<=i;j++)
cin>>triangle[i][j];

cout<<solve(triangle,n)<<endl;
for(int i=0;i<n;i++)
{
delete []triangle[i];
}
delete[]triangle;

return 0;
}