人机
by bingze36 @ 2024-03-23 08:03:06
```cpp
```
这道题明显用__int128+dp就能水过。
```cpp
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
typedef __int128 ll;
const int mx=81;
int n,m,a[mx][mx];
ll f[mx][mx],sum=0;
void write(ll x){
if(x<0)putchar('-'),x=-x;
if(x>9)write(x/10);
putchar(x%10+'0');
}
ll solve(int r){
memset(f,0,sizeof(f));
for(int i=1;i<=m;i++)f[i][1]=a[r][i]*2;
for(int j=2;j<=m;j++)for(int i=1;i<=m-j+1;i++)f[i][j]=max(f[i][j-1]+a[r][i+j-1],f[i+1][j-1]+a[r][i])*2;
return f[1][m];
}
int main(){
cin>>n>>m;
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++)cin>>a[i][j];
sum+=solve(i);
}
write(sum);
return 0;
}
```
by youth191954 @ 2024-04-16 12:35:00