https://www.luogu.org/problem/P1005
题意就不说了
做法
每一行之间都是相互独立的,所以各自取最大值加起来就可以了
然后状态转移也是十分简单,
如果第i个数到第j个数都还没被取到,
那么它的上一个状态就是
第i-1个数到第j个数没被取到或
第i个数到第j+1个数没被取到
一开始就这么想了,很简单就做下去了
结果只拿了60分
错误代码!!!!(未用高精度)
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<bitset>
#include<cstdlib>
#include<cmath>
#include<set>
#include<list>
#include<deque>
#include<queue>
#include<map>
#define ll long long
#define pb push_back
#define rep(x,a,b) for (int x=a;x<=b;x++)
#define repp(x,a,b) for (int x=a;x<b;x++)
#define pi 3.14159265358979323846
#define mem(a,x) memset(a,x,sizeof a)
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
using namespace std;
const int maxn=2e6+7;
const int INF=1e9;
const ll INFF=1e18;
ll dp[100][100];
ll a[300];
ll qmod(ll a,ll b){ll res=1;while(b){if (b&1)res=res*a;a*=a;b>>=1;}return res;}
int main()
{
int n,m;
scanf("%d%d",&n,&m);
ll sum=0,ans;
rep(i,1,n)
{
rep(j,1,m)
scanf("%lld",&a[j]);
rep(i,1,m)
rep(j,1,m)
dp[i][j]=-INFF;
dp[1][m]=0;
ll ans=0;
for (int p=1;p<=m;p++)
{
for (int q=m;q>=p;q--)
{
ll x=qmod(2,m-q+p-1);
dp[p][q]=max(dp[p][q],dp[p-1][q]+x*a[p-1]);
dp[p][q]=max(dp[p][q],dp[p][q+1]+x*a[q+1]);
}
}
rep(u,1,m)
ans=max(ans,dp[u][u]+qmod(2,m)*a[u]);
sum+=ans;
}
cout<<sum<<endl;
}