P1005 矩阵取数游戏（区间dp，高精度计算）

[NOIP2007 提高组] 矩阵取数游戏 - 洛谷

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

typedef long long LL;
const int N = 81;
int n,m;

vector<LL> ans,a[N][N],dp[N][N];

vector<LL> mul(int b,vector<LL> &A)
{
	vector<LL> C;
	long long t = 0;
	for(auto a : A){
		t += a*b;
		C.push_back(t%10);
		t /= 10;
	}
	while(t) C.push_back(t%10),t /= 10;
	while(C.size()&&!C.back()) C.pop_back();
	return C;
}

vector<LL> add(vector<LL> &A,vector<LL> &B)
{
	vector<LL> C;
	int t = 0;
	for(int i = 0;i<A.size()||i<B.size();i++){
		if(i<A.size()) t += A[i];
		if(i<B.size()) t += B[i];
		C.push_back(t%10);
		t /= 10;
	}
	while(t) C.push_back(t%10),t /= 10;
	while(C.size()>1&&!C.back()) C.pop_back();
	return C;
}

vector<LL> Max(vector<LL> &A,vector<LL> &B)
{
	if(A.size() > B.size()) return A;
	else if(A.size() < B.size()) return B;
	else{
		int len = A.size();
		while(len--){
			if(A[len] > B[len]) return A;
			else if(A[len] < B[len]) return B;
		}
	}
	return A;
}

void Dp()
{
	ans.push_back(0);
	for(int k=0;k<n;k++){
		memset(dp,0,sizeof(dp));
		for(int i=0;i<m;i++){
			dp[i][i] = mul(2,a[k][i]);
		}
		for(int len = 2;len <= m;len ++){
			for(int i=0,j = i+len-1;j<m;i++,j++){
				auto sum1 = add(dp[i+1][j],a[k][i]);
				auto sum2 = add(dp[i][j-1],a[k][j]);
				auto temp = Max(sum1,sum2);
				dp[i][j] = mul(2,temp);
			}
		}
		ans = add(ans,dp[0][m-1]);
	}
}

int main()
{
	cin>>n>>m;
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){
			int t;
			cin>>t;
			a[i][j].push_back(t);
		}
	}
	Dp();
	for(int i=ans.size()-1;~i;i--) cout<<ans[i];
	return 0;
}