Digital triangle model AcWing 1015. Picking flowers

Original link

AcWing 1015. Picking flowers

Algorithm tags

DP linear DP

Ideas

Code

#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 = 105;
int f[N][N], a[N][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);
	int t=read();
    while(t--){
        int r=read(), c=read();
        rep(i, 1, r+1){
            rep(j, 1, c+1){
                a[i][j]=read();
            }
        }
        rep(i, 1, r+1){
            rep(j, 1, c+1){
                f[i][j]=max(f[i-1][j], f[i][j-1])+a[i][j];
            }
        }
        printf("%lld\n", f[r][c]);
    }
	return 0;
}

Originality is not easy.
Reprint please indicate the source
If it helps you Don't forget to praise and support