WA 60pts求条(用了int128)

#include<bits/stdc++.h>
#define int __int128_t
using namespace std;
int n,m;
int a[114];
int dp[114][114];
inline void input(__int128 &s)
{
    s=0;
    char c=' ';
    while(c>'9'||c<'0') c=getchar();
    while(c>='0'&&c<='9')
    {
        s=s*10+c-'0';
        c=getchar();
    }
}

inline void output(__int128 x)
{
    if(x>9)
        output(x/10);
    putchar(x%10+'0');
}
signed main(){
    int ans = 0;
    input(m),input(n);
    for(int i = 1;i<=m;i++){
        for(int j = 1;j<=n;j++){
            input(a[j]);
        }
        int r;
        for(int len = n;len>=1;len--){
            for(int l = 1;l+len-1<= n;l++){
                r = l+len-1;
                dp[l][r] = max(dp[l-1][r]+a[l-1]*((int)1<<(n-len)),dp[l][r+1]+a[r+1]*((int)1<<(n-len)));
            }
        }
        int cur = 0;
        for(int j = 1;j<=n;j++){
            cur = max(cur,dp[j][j]+a[j]*(1<<n));
        }
        ans += cur;
    }
    output(ans);
    return 0;
}