AcWing
  • 首页
  • 题库
  • 题解
  • 分享
  • 问答
  • 活动
  • 应用
  • 吐槽
  • 登录/注册

bug



0


1
#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;
    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+1; j ++ )
            f[i][j] = 0;

    cout << n << endl;

    return 0;
}

问题

我最后打印 n 的值为零,这是为什么?



提问于8个月前
liuser
9012

哪道题啊 –  cht   8个月前

数字三角形吧 –  cht   8个月前

是的 –  liuser   8个月前



1 个问答



0

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;
}
回答于8个月前
cht
71303

我来回答
你确定删除吗?

© 2018-2021 AcWing 版权所有  |  京ICP备17053197号-1
联系我们  |  常见问题
AcWing
请输入登录信息
更多登录方式: 微信图标 qq图标
请输入绑定的邮箱地址
请输入注册信息