Day15
继续刷课!加快速度
和上一题基本一摸一样,只不过换了个判定条件。但是这个代码实现可以说是很妙了,二进制运用的太好了!
#include<bits/stdc++.h>
#define x first
#define y second
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int N = 14, M = 1 << 12, mod = 1e8;
int t, n, m;
int g[N];
vector<int> state, head[M]; // state存合法状态,head存head[i]的合法状态j
int f[N][M];
bool check(int state)
{
for (int i = 0; i < m; i++) {
if ((state >> i & 1) && (state >> i + 1 & 1)) // 判断是否有相邻的两个1
return false;
}
return true;
}
int main(void)
{
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> m;
for (int i = 1; i <= n; i++) {
for (int j = 0; j < m; j++) {
int t;
cin >> t;
g[i] += !t << j; // 取反的目的是为了后面能够判断是否合法
}
}
for (int i = 0; i < 1 << m; i++) {
if (check(i)) state.push_back(i); // 获取所有合法状态
}
for (int i = 0;i < state.size(); i++) {
for (int j = 0; j < state.size(); j++) { // 两两枚举合法状态,判断是否可以把b放到a后
int a = state[i], b = state[j];
if ((a & b) == 0) head[i].push_back(j);
}
}
f[0][0] = 1; // 初始状态什么都没种也是一种方案
for (int i = 1; i <= n + 1; i++) {
for (int a = 0; a < state.size(); a++) {
for (int b : head[a]) {
if (g[i] & state[a]) continue; // 说明你在不能种的地方种了,直接continue
f[i][a] = (f[i][a] + f[i - 1][b]) % mod;
}
}
}
cout << f[n + 1][0] << endl ;
return 0;
}
这里利用了滚动数组来优化空间
#include<bits/stdc++.h>
#define x first
#define y second
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int N = 110, M = 10, S = 1 << M;
int t, n, m;
int g[N];
int f[2][S][S]; // 滚动数组
vector<int> state;
int cnt[S];
bool check(int s)
{
for (int i = 0; i < m; i++) {
if ((s >> i & 1) && ((s >> i + 1 & 1) || (s >> i + 2 & 1)))
return false;
}
return true;
}
int count(int s)
{
int res = 0;
while (s) {
res += s & 1;
s >>= 1;
}
return res;
}
int main(void)
{
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> m;
for (int i = 0; i < n; i++ ) {
for (int j = 0; j < m; j++) {
char c;
cin >> c;
if (c == 'H') g[i] += 1 << j;
}
}
for (int i = 0; i < 1 << m; i++) {
if (check(i)) {
state.push_back(i);
cnt[i] = count(i);
}
}
for (int i = 0; i < n + 2; i++) {
for (int j = 0; j < state.size(); j++) {
for (int k = 0; k < state.size(); k++) {
for (int u = 0; u < state.size(); u++) {
int a = state[u], b = state[j], c = state[k];
if ((a & b) || (a & c) || (a & c)) continue;
if (g[i] & c) continue;
f[i & 1][j][k] = max(f[i & 1][j][k], f[i - 1 & 1][u][j] + cnt[c]);
}
}
}
}
cout << f[n + 1 & 1][0][0] << endl ;
return 0;
}
总结下状态压缩DP,很巧妙,而且代码量也不少,状态转移基本没什么难度,难在状态压缩上,二进制的运用实在巧妙,对位运算的运用可以说是让和我学到了很多很多,我在二进制这一方面也还得多下点功夫!
区间DP
上次做的石子合并是链状的,现在变成了环形的。处理方法有两种,第一种我们把每一堆石子当作一个点,每次合并相当于在两个点之间连一条线,这样最后肯定会有一个缺口,那我们可以枚举每一个缺口,强行把环拆解成链状,最后在套用我们线性石子合并的代码即可,但是这样会多一那个循环,复杂度达到 O ( n 4 ) O(n^4) O(n4) 显然不行,那么我们就要用到第二种处理方法,我们将原本的链复制一份加到后面去,这样链长度翻了一倍,也能把环状变成了链状,最后在套用代码即可。
状态转移方程: f [ L , R ] = m i n / m a x ( f [ L , R ] , f [ L , K ] + f [ K + 1 , R ] + s [ R ] − s [ L − 1 ] ) f[L, R] = min/max(f[L, R], f[L, K] + f[K + 1, R] + s[R] - s[L - 1]) f[L,R]=min/max(f[L,R],f[L,K]+f[K+1,R]+s[R]−s[L−1])
#include<bits/stdc++.h>
#define x first
#define y second
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int N = 410;
int t, n, m;
int s[N], w[N];
int g[N][N], f[N][N];
int main(void)
{
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n;
for (int i = 1;i <= n; i++) {
cin >> w[i];
w[i + n] = w[i]; // 复制一份加到后面去
}
for (int i = 1; i <= n * 2; i++) s[i] = s[i - 1] + w[i]; // 前缀和
memset(f, 0x3f, sizeof f); // 初始化最小最大
memset(g, -0x3f, sizeof g);
for (int len = 1; len <= n; len++) { // 枚举区间长度
for (int l = 1; l + len - 1 <= n * 2; l++) { // 枚举左端点
int r = len + l - 1; // 计算出右端点
if (len == 1) f[l][r] = g[l][r] = 0; // 如果区间长度为1, 那么合成费用为0
else {
for (int k = l; k < r; k++) { // 状态转移
f[l][r] = min(f[l][r], f[l][k] + f[k + 1][r] + s[r] - s[l - 1]);
g[l][r] = max(g[l][r], g[l][k] + g[k + 1][r] + s[r] - s[l - 1]);
}
}
}
}
int minn = 0x3f3f3f3f, maxx = -0x3f3f3f3f; // 遍历数组求出最大最小
for (int i = 1; i <= n; i++) {
minn = min(minn, f[i][i + n - 1]);
maxx = max(maxx, g[i][i + n - 1]);
}
cout << minn << endl << maxx << endl ;
return 0;
}
和上一题基本一样的思路。
状态转移方程: f [ L , R ] = m a x ( f [ L , R ] , f [ L , K ] + f [ K , R ] + w [ L ] ∗ w [ K ] ∗ w [ R ] ) f[L, R] = max(f[L, R], f[L, K] + f[K, R] + w[L] * w[K] *w[R]) f[L,R]=max(f[L,R],f[L,K]+f[K,R]+w[L]∗w[K]∗w[R])
#include<bits/stdc++.h>
#define x first
#define y second
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int N = 210;
int t, n, m;
int w[N];
int f[N][N];
int main(void)
{
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> w[i];
w[i + n] = w[i];
}
for (int len = 3; len <= n + 1; len++) {
for (int l = 1; l + len - 1 <= n * 2; l++) {
int r = l + len - 1;
for (int k = l + 1; k < r; k++) {
f[l][r] = max(f[l][r], f[l][k] + f[k][r] + w[l] * w[k] * w[r]);
}
}
}
int res = 0;
for (int i = 1; i <= n; i++) res = max(res, f[i][i + n]);
cout << res << endl ;
return 0;
}
去年蓝桥杯原题,当时写不出来也没去学一直惦记着,现在突然想起来了就赶紧补了这题,其实就是背包问题的一些应用变种而已。
状态表示: f [ i , j ] f[i, j] f[i,j] 前 i i i 个数字能否组成 j j j
#include<bits/stdc++.h>
#define x first
#define y second
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int N = 110, M = 200010, B = M / 2;
int t, n, m;
int w[N];
bool f[N][M];
int main(void)
{
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) cin >> w[i], m += w[i];
f[0][B] = true;
for (int i = 1; i <= n; i++) {
for (int j = -m; j <= m; j++) {
f[i][j + B] = f[i - 1][j + B];
if (j - w[i] >= -m) f[i][j + B] |= f[i - 1][j - w[i] + B];
if (j + w[i] <= m) f[i][j + B] |= f[i - 1][j + w[i] + B];
}
}
int res = 0;
for (int j = 1; j <= m; j++) {
if (f[n][j + B]) res++;
}
cout << res << endl ;
return 0;
}