数字三角形

数字三角形

http://lx.lanqiao.cn/problem.page?gpid=T794

相对于原来的数字三角形，多一个条件：向左下走的次数与向右下走的次数相差不能超过 1。

那么使用一个数组d来记录向左走与向右走的差值, 输出时判断d[n][i]的大小即可

#include<iostream>
#include "cmath"

using namespace std;

const int N = 110, INF = 1e9;

int f[N][N], d[N][N];

int a[N][N], n;

int main()
{
    cin >> n;

    for (int i = 1; i <= n; i ++ )
        for (int j = 1; j <= i; j ++ )
            cin >> a[i][j];

    for (int i = 0; i <= n; i ++ )
        for (int j = 0; j <= i; j ++ )
            f[i][j] = -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] + a[i][j], f[i - 1][j - 1] + a[i][j]);
            d[i][j] = f[i - 1][j] > f[i - 1][j - 1] ? d[i - 1][j] - 1 : d[i - 1][j - 1] + 1;
        }

    int res = -INF;
    for (int i = 1; i <= n; i ++ )
        if (abs(d[n][i]) <= 1) res = max(res, f[n][i]);

    cout << res << endl;

    return 0;
}