好久没有来水博客了,来水一道区间dp吧。这道题应该不难看出是区间dp,而且很简单,所以我就拿来水一篇博客.
#include<iostream>
#include<stdio.h>
#include<math.h>
#include<string.h>
#include<string>
#include<vector>
#include<queue>
#include<algorithm>
#include<deque>
#include<map>
#include<stdlib.h>
#include<set>
#include<iomanip>
#include<stack>
#define ll long long
#define ms(a,b) memset(a,b,sizeof(a))
#define lowbit(x) x & -x
#define fi first
#define se second
#define endl "\n"
#define bug cout<<"----acac----"<<endl
#define IOS ios::sync_with_stdio(false), cin.tie(0),cout.tie(0)
using namespace std;
const int maxn = 2e5 + 5;
const int maxm = 1.5e5+50;
const double eps = 1e-7;
const double inf = 0x3f3f3f3f;
const double lnf = 0x3f3f3f3f3f3f3f3f;
const int mod = 1e9+7;
const double pi=3.141592653589;
int a[maxn],dp[105][105];
int main()
{
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
dp[i][i]=a[i];//取一个数的话价值就是他的本身
}
for(int len=2;len<=n;len++)
{
for(int l=1;l+len-1<=n;l++)
{
int r=l+len-1;
dp[l][r]=abs(a[l]-a[r])*(r-l+1);//每次更新,新区间的值
for(int k=l;k<=r;k++)
{
dp[l][r]=max(dp[l][r],dp[l][k]+dp[k+1][r]);//再用原来的区间来更新新区间
}
}
}
printf("%d\n",dp[1][n]);
return 0;
}