N改成n

#include <iostream>
#include <cstring>

using namespace std;

const int N = 510, INF = 1e9;

int a[N][N], f[N][N], n;

int main()
{
    cin >> n;
    //cout << n << endl;    
    for (int i = 1; i <= n; i ++ )
        for (int j = 1; j <= i; j ++ )
            cin >>a[i][j];
    //cout << n << endl;
    for (int i = 0; i < n/*这里改成n，但不知道哪题*/; i ++ )
        for (int j = 0; j <= i+1; j ++ )
            f[i][j] = 0;

    cout << n << endl;

    return 0;
}

数字三角形AC代码：

#include<iostream>
using namespace std;
const int N = 510, INF = 1e9;
int n, a[N][N], f[N][N];
int main()
{
    scanf("%d", &n);
    for(int i = 1; i <= n; i ++)
        for(int j = 1;j <= i; j ++)
            scanf("%d", &a[i][j]);
    for(int i = 0; i <= n; i ++)
        for(int j = 0; j <= i + 1; j ++)
            f[i][j] = -INF;
    int res = -INF;
    f[1][1] = a[1][1];
    for(int i = 2; i <= n; i ++)
        for(int j = 1; j <= i; j ++)
            f[i][j] = max(f[i - 1][j - 1] + a[i][j], f[i - 1][j] + a[i][j]);
    for(int i = 1; i <= n; i ++ ) res = max(res, f[n][i]);
    cout << res;
}

回答于28天前

cht

14230