7-1数字三角形

#include<iostream>
using namespace std;
const int N = 10005;
int D[N][N];
int max(int a, int b)
{
	int m = a > b ? a : b;
	return m;
}
int fun3(int n)
{
	int i, j;
	for (i = n - 2; i >= 0; i--)
	{
		for (j = 0; j <= i; j++)
		{
			D[n-1][j] = max(D[n-1][j] , D[n-1][j + 1])+D[i][j];
		}
	}
	return D[n-1][0];
}
int main()
{
	int n, i, j;

	cin >> n;//n行数
	for (i = 0; i < n; i++)
	{
		for (j = 0; j <= i; j++)
		{
			cin >> D[i][j];
		}
	}
	int MaxSum = fun3(n);
	cout << MaxSum << endl;
	return 0;
}

​​​​​​​

#include<iostream>
#include <algorithm>
using namespace std;
int main()
{
    int n;
    int a[501][501];
    cin>>n;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=i;j++)
            cin>>a[i][j];
    for(int i=n;i>0;i--)
        for(int j=1;j<&#