悬关！！！

花花绿绿

#include<bits/stdc++.h>
using namespace std;

long long n, m, a[85][85], f[85][85], sum;
long long fun(long long x)
{
	memset(f, 0, sizeof(f));
    for(int len = 0; len <= m; len++)
    	for(int i = 1; i + len <= m; i++)
            f[i][i + len] = max(2 * f[i + 1][i + len] + 2 * 
                                a[x][i], 2 * f[i][i + len - 1] + 2 * 
                                a[x][i + len]);
    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];
	for(int i = 1; i <= n; i++) sum += fun(i);
	cout << sum;
	return 0;
}