DP都不会了,马上重开
看注释
C o d e : Code: Code:
#include<bits/stdc++.h>
#include<unordered_map>
#include<unordered_set>
#define mem(a,b) memset(a,b,sizeof a)
#define cinios (ios::sync_with_stdio(false),cin.tie(0),cout.tie(0))
#define forr(a,b,c) for(int a=b;a<=c;a++)
#define all(a) a.begin(),a.end()
#define sz(a) (int)a.size()
#define oper(a) operator<(const a& ee)const
#define endl "\n"
#define ul (u << 1)
#define ur (u << 1 | 1)
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
const int N = 1e6 + 10, M = 2e5 + 10, mod = 1e9 + 7;
int INF = 0x3f3f3f3f; ll LNF = 0x3f3f3f3f3f3f3f3f;
int n, m, k;
char s[N];
int dp[N][2][26];//前 i 个字符中修改,长度为 偶/奇,且以 第 i 个字符结尾的字符为 j 的串的最小操作数
//长度为 偶 时就是合格串,长度为 奇 时,除去最后一个字符就满足合格串
void solve() {
cin >> s + 1;
n = strlen(s + 1);
mem(dp, 0x3f);
for (int j = 0; j < 26; j++)dp[0][0][j] = 0;
for (int i = 1; i <= n; i++) {
int mi = INF;
for (int j = 0; j < 26; j++)mi = min(mi, dp[i - 1][0][j]);
for (int j = 0; j < 26; j++) {
int val = ((s[i] - 'a') == j ? 0 : 1);
//偶合法串考虑最后一个不同点,由删去、修改转移得来
dp[i][0][j] = min(dp[i - 1][0][j] + 1, dp[i - 1][1][j] + val);
//奇'合法串'同理,但修改可以发现,由偶合法串任意字符结尾转移都可,所以选个最小的转移
dp[i][1][j] = min(dp[i - 1][1][j] + 1, mi + val);
}
}
int ans = INF;
for (int j = 0; j < 26; j++)ans = min(ans, dp[n][0][j]);
cout << ans;
}
int main() {
cinios;
int T = 1;
for (int t = 1; t <= T; t++)
solve();
return 0;
}
/*
*/