知识点–区间dp
特点:每次只能去左边或右边的值,给出求值公式求出极值。
取数游戏
思路:区间长度为1的区间dp,考虑到
f
[
i
]
[
j
]
f[i][j]
f[i][j] 为区间
[
i
,
j
]
[i,j]
[i,j]的最大值;
那么先手取左边或者右边就会给后手玩家两个状态
[
i
+
1
,
j
]
,
[
i
,
j
−
1
]
[i+1,j],[i,j-1]
[i+1,j],[i,j−1],先手取得最大值,就要使后手取
f
[
i
+
1
,
j
]
,
f
[
i
,
j
−
1
]
f[i+1,j],f[i,j-1]
f[i+1,j],f[i,j−1]的最小值,那么状态转移方程为
f
[
i
]
[
j
]
=
s
u
m
[
j
]
−
s
u
m
[
i
−
1
]
−
m
i
n
(
f
[
i
+
1
]
[
j
]
,
f
[
i
]
[
j
−
1
]
)
f[i][j] = sum[j] - sum[i-1] - min(f[i+1][j],f[i][j-1])
f[i][j]=sum[j]−sum[i−1]−min(f[i+1][j],f[i][j−1]),即先手在区间
[
i
,
j
]
[i,j]
[i,j]得最大值为区间
[
i
,
j
]
[i,j]
[i,j]的和减去后手所选的;区间长度为1
int f[N][N],sum[N],a[N];
signed main()
{
int n; cin >> n;
forr(i,1,n){
cin >> a[i];
sum[i] =sum[i-1] + a[i];
}
//mem(f,inf);
forr(i,1,n) f[i][i] = a[i];
for(int i = n;i >= 1;i--){ //用到 i+1 从后往前枚举
forr(j,i,n){ // 用到j-1,从前往后枚举
f[i][j] = sum[j] - sum[i-1] - min(f[i+1][j],f[i][j-1]);
}
}
cout << f[1][n] <<" " << sum[n] - f[1][n] << endl;
return 0;
}
取数游戏2
思路:一般状态规划思路,把区间长度
l
e
n
len
len作为阶段
,枚举区间左右端点,由于取数游戏的限制每次只能从两边取,这样只要考虑取那一边最优,这里我们逆向考虑先从只有一个数开始取往里面加数,转移方程为:
f
[
j
]
[
p
]
=
m
a
x
(
f
[
j
+
1
]
[
p
]
+
a
[
j
]
∗
b
[
n
−
i
+
1
]
,
f
[
j
]
[
p
−
1
]
+
a
[
p
]
∗
b
[
n
−
i
+
1
]
)
f[j][p] = max(f[j+1][p] + a[j]*b[n-i+1],f[j][p-1]+a[p]*b[n-i+1])
f[j][p]=max(f[j+1][p]+a[j]∗b[n−i+1],f[j][p−1]+a[p]∗b[n−i+1]),f[j][p]
表示在区间[j,p]
内可以取得的最值。
因为是逆向取,所以第i次取要乘上b[n-i+1]
int f[1010][1010];
signed main()
{
int t; cin >> t;
while(t--){
int n; cin >> n;
vector<int> a(n+1),b(n+1);
forr(i,1,n) cin >> a[i];
forr(i,1,n) cin >> b[i];
int id = 0;
for(int i = 1; i <= n; i++){
for(int j = 1; j + i - 1 <= n;j++){
int p = j + i - 1;//注意因为是逆向取,所以第i次取要乘上b[n-i+1];
f[j][p] = max(f[j+1][p] + a[j]*b[n-i+1],f[j][p-1]+a[p]*b[n-i+1]);
}
}
cout << f[1][n] << endl;
mem(f,0);
}
return 0;
}
[NOIP2007]矩阵取数游戏
思路: 通过题意可以知道,对于每一行我们只要考虑它每个数乘上的是2的几次幂,可以所得的值最大,并且每一行独立,可以发现和取数游戏几ll一样只是把b数组变为了2的次幂;
这里注意答案可能爆ll,可以用int128,使用快读和快写来输入输出;
/*
author:@bzdhxs
date:2022/1/22
URL:https://ac.nowcoder.com/acm/contest/24213/1029;
*/
#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstring>
#include<string>
#include<vector>
#include<map>
#include<queue>
using namespace std;
template <typename T>
inline void read(T &s){s = 0;T w = 1, ch = getchar();while (!isdigit(ch)) { if (ch == '-') w = -1; ch = getchar(); }while (isdigit(ch)) { s = (s << 1) + (s << 3) + (ch ^48); ch = getchar();} s *= w;}
template <typename T>
inline void write(T s){if (s < 0) putchar('-'), s = -s;if (s > 9) write(s / 10);putchar(s % 10 + '0');}
#define int __int128_t
#define _orz ios::sync_with_stdio(false),cin.tie(0)
#define mem(str,num) memset(str,num,sizeof(str))
#define forr(i,a,b) for(int i = a; i <= b;i++)
#define forn(i,n) for(int i = 0; i < n; i++)
#define dbg() cout <<"0k!"<< endl;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int N = 1e6+10;
int n,m;
int a[85][85];
int f[85][85];
signed main()
{
read(n);read(m);
forr(i,1,n) forr(j,1,m) read(a[i][j]);
int res = 0;
forr(k,1,n){
mem(f,0);
forr(len,1,m){
for(int i = 1; i + len - 1 <= m; i++){
int j = i+ len - 1;
f[i][j] = max(f[i+1][j]+a[k][i]*((int)1 << (m-len+1)),f[i][j-1]+a[k][j]*((int)1 << (m-len+1)));
}
}
res += f[1][m];
}
write(res);
return 0;
}
快读快写板子
template<typename T>
inline void read(T &s){
s = 0;
T w = 1,ch = getchar();
while(!isdigit(ch)){
if(ch == '-') w = -1;
ch = getchar();
}
while(isdigit(ch)){
s = (s << 1) + (s << 3) + (ch^48);
ch = getchar();
}
s *= w;
}
template<typename T>
inline void print(T s){
if(s < 0) putchar('-'), s = -s;
if(s > 9) print(s / 10);
putchar(s % 10 + '0');
}