线性DP AcWing 898. 数字三角形

线性DP AcWing 898. 数字三角形

原题链接

AcWing 898. 数字三角形

算法标签

动态规划 线性DP

思路

代码

#include<bits/stdc++.h>
#define int long long
#define rep(i, a, b) for(int i=a;i<b;++i)
#define Rep(i, a, b) for(int i=a;i>b;--i)
using namespace std;
const int N = 505, INF = 0x3f3f3f3f;
int w[N][N], f[N][N];
int n;
inline int read(){
   int s=0,w=1;
   char ch=getchar();
   while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
   while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
   return s*w;
}
void put(int x) {
    if(x<0) putchar('-'),x=-x;
    if(x>=10) put(x/10);
    putchar(x%10^48);
}
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    n=read();
    rep(i, 1, n+1){
        rep(j, 1, i+1){
            w[i][j]=read();
        }
    }
    rep(i, 1, n+1){
        f[n][i]=w[n][i];
    }
    Rep(i, n-1, -1){
        rep(j, 1, i+1){
            f[i][j]=max(f[i+1][j], f[i+1][j+1])+w[i][j];
        }
    }
    printf("%lld", f[1][1]);
    return 0;
}

优化代码

由于可以直接将数字存储至f[N][N]，进行状态转移运算时累加即可，所以可以优化掉w[N][N]

#include<bits/stdc++.h>
#define int long long
#define rep(i, a, b) for(int i=a;i<b;++i)
#define Rep(i, a, b) for(int i=a;i>b;--i)
using namespace std;
const int N = 505, INF = 0x3f3f3f3f;
int  f[N][N];
int n;
inline int read(){
   int s=0,w=1;
   char ch=getchar();
   while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
   while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
   return s*w;
}
void put(int x) {
    if(x<0) putchar('-'),x=-x;
    if(x>=10) put(x/10);
    putchar(x%10^48);
}
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    n=read();
    rep(i, 1, n+1){
        rep(j, 1, i+1){
            f[i][j]=read();
        }
    }
    Rep(i, n-1, -1){
        rep(j, 1, i+1){
            f[i][j]+=max(f[i+1][j], f[i+1][j+1]);
        }
    }
    printf("%lld", f[1][1]);
    return 0;
}

原创不易
转载请标明出处
如果对你有所帮助 别忘啦点赞支持哈