一道acm题 题目是Number Triangle 我的程序样例可以通过 但是无法AC 提示wa 不懂有什么问题了

一道acm题 题目是Number Triangle 我的程序样例可以通过 但是无法AC 提示wa 不懂有什么问题了
Problem Description
Consider the number triangle shown below.Write a program that calculates the highest sum of numbers that can be passed on a route that starts at the top and ends somewhere on the base.Each step can go either diagonally down to the left or diagonally down to the right.
7
3 8
8 1 0
2 7 4 4
4 5 2 6 5
In the sample above,the route from 7 to 3 to 8 to 7 to 5 produces the highest sum:30.
Input
There are multiple test cases.The first line of each test case contains R (1 sz;
int **arr=new int *[sz];
for(int i=0;i=0;i--)
{
for(int j=0;jarr[i+1][j+1]?arr[i+1][j]:arr[i+1][j+1]);
arr[i][j]=arr[i][j]+max;
}
}
cout