[2019蓝桥杯国赛B组c++][最优包含][排列数][解谜游戏][第八大奇迹]

本文链接：https://blog.csdn.net/xuxiaobo1234/article/details/109662250

个人题解链接，蓝桥杯历届试题，正在更新中~

文章目录

个人题解链接，蓝桥杯历届试题，正在更新中~

一个大佬写了填空题的答案，点击下面链接

最优包含

题目链接：点击
思路：显然的dp.
$设状态为 d p [i] [j] 代表前 i 个包含前 j 个要改变的次数$
转移方程:
$i f s [i] = = t [j] : d p [i] [j] = d p [i - 1] [j - 1]$
$e l s e : d p [i] [j] = m i n (d p [i - 1] [j], d p [i - 1] [j - 1] + 1)$
注意初始化为正无穷， $d p [i] [0]$ 初始化为0

#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int INF = 0x3f3f3f3f;
const double Pi = acos(-1);
namespace {
   
  template <typename T> inline void read(T &x) {
   
    x = 0; T f = 1;char s = getchar();
    for(; !isdigit(s); s = getchar()) if(s == '-') f = -1;
    for(;  isdigit(s); s = getchar()) x = (x << 3) + (x << 1) + (s ^ 48);
    x *= f;
  }
}
#define fio ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define _for(n,m,i) for (register int i = (n); i <  (m); ++i)
#define _rep(n,m,i) for (register int i = (n); i <= (m); ++i)
#define _srep(n,m,i)for (register int i = (n); i >= (m); i--)
#define _sfor(n,m,i)for (register int i = (n); i >  (m); i--)
#define lson rt << 1, l, mid
#define rson rt << 1 | 1, mid + 1, r
#define lowbit(x) x & (-x)
#define pii pair<int,int>
#define fi first
#define se second
const int N = 1e3+5;
char s[N], t[N];
int dp[N][N];// 前i个和包括了前j个要改几次 
int main() {
   
  scanf("%s %s", s + 1, t + 1);
  int n = strlen(s+1),