蓝桥杯--跳跃

https://www.lanqiao.cn/problems/553/learning/

#include<bits/stdc++.h>
using namespace std;
int a[105][105];
int n,m;
int find_max(int x,int y){
    int i,j,max=0;
    for(i=x;i>=1;i--)
        for(j=y;j>=1;j--)
            if(!(x==i&&y==j)&&(x-i+y-j)<=3&&max<a[i][j])
                max=a[i][j];
    return max;
}
int main(){
    cin>>n>>m;
    int i,j;
    for(i=1;i<=n;i++)
        for(j=1;j<=m;j++)
            cin>>a[i][j];
    for(i=1;i<=n;i++)
        for(j=1;j<=m;j++)
            a[i][j]+=find_max(i,j);
    cout<<a[n][m]+a[1][1];
}