CODEVS 1166 矩阵取数游戏

//因为每行独立，所以可以边读入边处理。dp(i, j)表示区间[i, j]内的最大分数，要用高精度加法。每次新取一个值才将之前的*2，这样最后需要加两遍dp(1, m). 
#include<cstdio>
#include<vector>
#include<cstring>
#include<iostream>
using namespace std;

struct bigint{
    static const int base = 100000000;
    static const int width = 8;
    vector<int> s;
    bigint(long long num = 0) { *this = num; }
    bigint operator = (long long num) {
        s.clear();
        do{
            s.push_back(num % base);
            num /= base;
        }while(num > 0);
        return *this;
    }
    bigint operator + (const bigint& b) const {
        bigint c;
        c.s.clear();
        for(int i = 0, g = 0; ; i++){
            if(g == 0 && i >= s.size() && i >= b.s.size())  break;
            int x = g;
            if(i < s.size())    x += s[i];
            if(i < b.s.size())  x += b.s[i];
            c.s.push_back(x % base);
            g = x / base;
        }
        return c;
    }
    bool operator < (const bigint& b) const {
        if(s.size() != b.s.size())  return s.size() < b.s.size();
        for(int i = s.size() - 1; i >= 0; i--)
            if(s[i] != b.s[i])  return s[i] < b.s[i];
        return false;
    }
} dp[82][82];

ostream& operator << (ostream &out, const bigint &x){
        out << x.s.back();
        for(int i = x.s.size() - 2; i >= 0; i--){
            char buf[20];
            sprintf(buf, "%08d", x.s[i]);
            for(int j = 0; j < strlen(buf); j++)    out << buf[j];
        }
        return out;
}

int main(){
    bigint ans(0);
    int n, m;
    cin >> n >> m;
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++)
            for(int k = 1; k <= m; k++)
                dp[j][k] = 0;
        for(int j = 1; j <= m; j++){
            int a;
            cin >> a;
            dp[j][j] = a;
        }
        for(int k = 2; k <= m; k++)
            for(int j = 1; j <= m-k+1; j++){
                int l = j + k - 1;
                bigint x = dp[l][l] + dp[j][l-1] + dp[j][l-1];
                bigint y = dp[j][j] + dp[j+1][l] + dp[j+1][l];
                if(y < x)   dp[j][l] = x; else  dp[j][l] = y;
            }
        ans = dp[1][m] + dp[1][m] + ans;
    }
    cout << ans << endl;
    return 0;
}