P1005 [NOIP2007 提高组] 矩阵取数游戏（区间dp）

P1005 [NOIP2007 提高组] 矩阵取数游戏https://www.luogu.com.cn/problem/P1005

 dp数组其实开大了，二维就可以但刚开始写的时候直接写了个四维的

#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <unordered_map>
#include <cmath>
#include <map>
#include <cctype>
#include <cstdlib>
#include <deque>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 1000010;
const int INF = 0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false)
#define lowbit(x) ((x)&(-x))

int n, m;
int s[100][100];
__int128 f[100][100][100][2];

inline void output(__int128 x) {
	if (x > 9)
		output(x / 10);
	putchar(x % 10 + '0');
}

int main() {
	scanf("%d %d", &n, &m);
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= m; j++) {
			scanf("%d", &s[i][j]);
			f[i][j][j][0] = s[i][j] * (__int128) pow(2, m);
		}
	for (int h = 1; h <= n; h++) {
		for (int l = 1; l < m; l++) {
			for (int i = 1; i <= m - l; i++) {
				int j = i + l;
				f[h][i][j][0] = max(f[h][i][j][0], max(f[h][i + 1][j][0] + s[h][i] * (__int128)pow(2, m - l),
				                                       f[h][i + 1][j][1] + s[h][i] * (__int128) pow(2, m - l)));
				f[h][i][j][1] = max(f[h][i][j][1], max(f[h][i][j - 1][0] + s[h][j] * (__int128) pow(2, m - l),
				                                       f[h][i][j - 1][1] + s[h][j] * (__int128) pow(2, m - l)));
			}
		}
	}
	__int128 ans = 0;
	for (int i = 1; i <= n; i++) {
		ans += max(f[i][1][m][0], f[i][1][m][1]);
	}
	output(ans);
	return 0;
}