10152. 「一本通 5.1 练习 3」矩阵取数游戏

#include<algorithm>
#include<bitset>
#include<complex>
#include<deque>
#include<exception>
#include<fstream>
#include<functional>
#include<iomanip>
#include<ios>
#include<iosfwd>
#include<iostream>
#include<istream>
#include<iterator>
#include<limits>
#include<list>
#include<locale>
#include<map>
#include<memory>
#include<new>
#include<numeric>
#include<ostream>
#include<queue>
#include<set>
#include<sstream>
#include<stack>
#include<stdexcept>
#include<streambuf>
#include<string>
#include<typeinfo>
#include<utility>
#include<valarray>
#include<vector>
#include<cctype>
#include<cerrno>
#include<cfloat>
#include<ciso646>
#include<climits>
#include<clocale>
#include<cmath>
#include<csetjmp>
#include<csignal>
#include<cstdarg>
#include<cstddef>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#define int __int128
using namespace std;
#define MAXN 1010
inline int read(){
    int res=0,f=1;char ch=getchar();
    while(ch<'0'ch>'9'){if(ch=='-') f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9') res=res*10+ch-'0',ch=getchar();
    return res*f;
}
inline void write(int x){
    if(x<0) putchar('-'),x=-x;
    if(x<10) putchar(x+'0');
    else{
        write(x/10);
        putchar(x%10+'0');
    }
}
//queue<int> q;
//set<int> s;
//priority_queue<int> q1;
//priority_queue<int,vector<int>,greater<int> > q2;
//list<int> l;
//stack<int> s;
int n,m,a[MAXN][MAXN],f[MAXN][MAXN],pw[1010],ss,ans;
int dp(int x,int y){
    if(f[x][y]!=-1) return f[x][y];
    if(y-x>=1) f[x][y]=max(dp(x+1,y)+pw[m-(y-x)]*a[ss][x],dp(x,y-1)+pw[(m-(y-x))]*a[ss][y]);
    else f[x][y]=a[ss][x]*pw[(m-(y-x))];
    return f[x][y];
}
signed main(){
    pw[0]=1;
    for(int i=1;i<1000;i++) pw[i]=pw[i-1]*2;
    n=read();m=read();for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) a[i][j]=read();
    for(int i=1;i<=n;i++){
        ss=i;
        memset(f,-1,sizeof(f));
        ans+=dp(1,m);
    }
    write(ans);putchar('\n');
    return 0;
}