DP(区间专题一)

题意: 有若干零食n,装在管子里(编号从$1-n$), 现每天可以拿出一盒零食,每拿出一盒零食对答案的贡献就是该零食的价格乘上拿该零食的天数, 问最大价值是多少.

>> face <<

Strategy:记忆化搜索或者区间dp

状态: dp[l][r]->该区间内的最大收益

目标:$dp[1][n]$全区间内的最大收益

边界: 第一次转移的贡献全由零食的价格提供. 不需要额外提供边界(记忆化搜索) , 枚举所有边界长度为1的所有子区间为a[i] * n,代表该区间的最大收益

合法判断: 本题无

转移方程: 区间dp:

$$dp[l][r]=max(dp[l][r-1]+(n-len+1)\ast a[r],dp[l+1][r]+(n-len+1)\ast a[l]);$$

attention: 边界

双倍经验:

@author: jasonleft -- 记忆化
#include <bits/stdc++.h>
#include <bits/extc++.h>
#define _rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define _rev(i, a, b) for (int i = (a); i >= (b); --i)
#define _for(i, a, b) for (int i = (a); i < (b); ++i)
#define _rof(i, a, b) for (int i = (a); i > (b); --i)
#define ll long long
#define db double
#define oo 0x3f3f3f3f
#define eps 0.00001
#define all(x) x.begin(), x.end()
#define met(a, b) memset(a, b, sizeof(a))
#define what_is(x) cerr << #x << " is " << x << endl
#define lowbit(x) x &(-x)
using namespace std;
const int maxn = 2e3 + 5;
const int mod = 9999973;
int a[maxn], n, dp[maxn][maxn], ans;
int dfs(int day, int l, int r)
{
	if(r < l)return 0;
	if(dp[l][r])return dp[l][r];
	return dp[l][r] = max(dfs(day+1,l+1,r)+a[l]*day, dfs(day+1, l, r - 1)+a[r] * day);
}
int main()
{
	ios::sync_with_stdio(0);
	cin >> n;
	_rep(i, 1, n) cin >> a[i];
	
	cout <<dfs(1, 1, n) << endl;
}

@author: jasonleft -- 区间dp
#include <bits/stdc++.h>
#include <bits/extc++.h>
#define _rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define _rev(i, a, b) for (int i = (a); i >= (b); --i)
#define _for(i, a, b) for (int i = (a); i < (b); ++i)
#define _rof(i, a, b) for (int i = (a); i > (b); --i)
#define ll long long
#define db double
#define oo 0x3f3f3f3f
#define eps 0.00001
#define all(x) x.begin(), x.end()
#define met(a, b) memset(a, b, sizeof(a))
#define what_is(x) cerr << #x << " is " << x << endl
#define lowbit(x) x &(-x)
using namespace std;
const int maxn = 2e3 + 5;
const int mod = 9999973;
int a[maxn], n, dp[maxn][maxn], ans;

int main()
{
	ios::sync_with_stdio(0);
	cin >> n;
	_rep(i, 1, n) cin >> a[i];
	_rep(i, 1, n) dp[i][i] = a[i] * n; //为啥要乘以n? dp[i][j]代表其区间中最大的价值, 所以要乘以n
	_rep(len, 2, n)
	{
		_rep(l, 1, n - len + 1)
		{
			int r = l + len - 1;
			dp[l][r] = max(dp[l][r - 1] + (n - len + 1) * a[r], dp[l + 1][r] + (n - len + 1) * a[l]);
		}
	}
	cout << dp[1][n] << endl;
}

第一次回顾:

• 区间dp的精髓 : 转移的方式, 搞清楚如何从短区间转移到长区间
• 边界也挺重要的其实

#include <bits/stdc++.h>
#include <bits/extc++.h>
#define _rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define _rev(i, a, b) for (int i = (a); i >= (b); --i)
#define _for(i, a, b) for (int i = (a); i < (b); ++i)
#define _rof(i, a, b) for (int i = (a); i > (b); --i)
#define ll long long
#define db double
#define oo 0x3f3f3f3f
#define eps 0.00001
#define all(x) x.begin(), x.end()
#define met(a, b) memset(a, b, sizeof(a))
#define id(x) ((x + 8))
#define what_is(x) cerr << #x << " is " << x << endl
#define lowbit(x) x &(-x)
using namespace std;
const int maxn = 2e3 + 9;
const int mod = 1e6 + 3;
int dp[maxn][maxn], n, a[maxn];
int main()
{
	ios::sync_with_stdio(0);
	int n;
	cin >> n;
	_rep(i, 1, n)
	{
		cin >> a[i];
		dp[i][i] = a[i] * n;
	}
	_rep(len, 2, n){
		_rep(l, 1, n - len + 1){
			int r = l + len - 1;
			dp[l][r] = max(dp[l+1][r] + a[l] * (n - len + 1), dp[l][r-1] + a[r] * (n - len + 1));
		}
	}
	cout << dp[1][n] << endl;
}