[NOIP2007] 矩阵取数游戏 【记忆化搜索+高精】

题目

其实感觉这题重点不是dp而是高精

因为只能取队首尾的数字，所以用dp[i][j]表示取剩下的i~j的数所能得到的最大值

dp[i][j]=max(dp[i+1][j]+2^(m-j+i)*num[i],dp[i][j-1]+2^(m-j+i)*num[j]);

代码

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstdlib>
#include<cstring>
using namespace std;
const int N=100;
int n, m;

struct Big
{
    int len, s[200];
    Big(){len=0; memset(s, 0, sizeof(s));}
    const bool &operator > (Big &b)
    {
        if(len > b.len) return true;
        if(len < b.len) return false;
        for(int i=len-1; i >= 0; i--)
        {
            if(s[i] > b.s[i]) return true;
            if(s[i] < b.s[i]) return false;
        }
        return false;
    }
}dp[N][N], ans, st[N], num[N];

istream &operator >> (istream &in, Big &a)
{
    string c;in>>c;
    a.len=c.size();
    for(int i=0; i < a.len; i++) a.s[a.len-1-i]=c[i]-'0';
    return in;
}

ostream &operator << (ostream &out, Big &a)
{
    if(!a.len) out<<0;
    for(int i=a.len-1; i >= 0; i--) out<<a.s[i];
    return out;
}

Big &operator + (Big a, Big b)
{
    Big c=Big();
    c.len=max(a.len, b.len);
    int carry=0;
    for(int i=0; i < c.len; i++)
    {
        c.s[i]=a.s[i]+b.s[i]+carry;
        carry=c.s[i]/10;
        c.s[i]%=10;
    }
    if(carry) c.s[c.len++]=carry;
    return c;
}

Big &operator * (Big a, Big b)
{
    Big c=Big();
    c.len=a.len+b.len;
    int carry=0;
    for(int i=0; i < a.len; i++){
        for(int j=0; j < b.len; j++)
        {
            c.s[i+j]+=a.s[i]*b.s[j]+carry;
            carry=c.s[i+j]/10;
            c.s[i+j]%=10;
        }
        if(carry) c.s[i+b.len]+=carry, carry=0;
    }
    while(!c.s[c.len-1]) c.len--;
    return c;
}

void work(int l, int r)
{
    if(dp[l][r].len) return ;
    if(l > r) return ;
    if(l == r) { dp[l][l]=num[l]*st[m]; return ;}
    work(l+1, r); work(l, r-1);
    Big t1, t2;
    t1=dp[l+1][r]+(num[l]*st[m-r+l]);
    t2=dp[l][r-1]+(num[r]*st[m-r+l]);
    if(t1 > dp[l][r]) dp[l][r]=t1;
    if(t2 > dp[l][r]) dp[l][r]=t2;
}

int main()
{
    cin>>n>>m;
    Big two=Big(); two.len=1; two.s[0]=2;
    st[0].len=1; st[0].s[0]=1;
    for(int i=1; i <= m; i++) st[i]=st[i-1]*two;
    for(int i=1; i <= n; i++)
    {
        memset(num, 0, sizeof(num)); memset(dp, 0, sizeof(dp));
        for(int i=1; i <= m; i++) cin>>num[i];
        work(1, m);
        ans=ans+dp[1][m];
    }
    cout<<ans<<endl;
    return 0;
}