1020 Delete At Most Two Characters (35 分)
解题思路:
用dp[i][j]表示为前i个字符删j个的情况数(1<=i<=n,0<=j<=2)。
那么很简单得到递推式:dp[i][j]=dp[i-1][j]+dp[i-1][j-1](即新加的第i个字符删和不删的情况),但是我们会发现,新加的第i个字符删和不删的两个状态可能会有重复,那么需要找到对于dp[i][j]重复情况数,即从i位置往前找到一个最大的pos满足s[pos]==s[i],这样重复的情况数就为dp[pos-1][j-(i-pos)](1<=i-pos<=2)。
那么最后的状态转移方程为:dp[i][j]=dp[i-1][j]+dp[i-1][j-1]-dp[pos-1][j-(i-pos)]
设置一下初始状态dp[0][0]=1,dp[1][0]=1,dp[1][1]=1,dp[1][2]=0
证明情况如下:
代码:
#include<bits/stdc++.h>
#include<unordered_map>
#include<unordered_set>
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mp make_pair
#define pb push_back
#define G 6.67430*1e-11
#define rd read()
#define pi 3.1415926535
using namespace std;
const ll mod = 1e9 + 7;
const int MAXN = 30000005;
const int MAX2 = 300005;
inline ll read() {
ll x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch>'9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = (x << 1) + (x << 3) + (ch ^ 48);
ch = getchar();
}
return x * f;
}
ll fpow(ll a, ll b)
{
ll ans = 1;
while (b)
{
if (b & 1)ans = ans * a % mod;
b >>= 1;
a = a * a % mod;
}
return ans;
}
ll dp[1000005][3];
signed main()
{
string s,t;
cin >> s;
t += '1'+s;
dp[0][0] = 1;
dp[1][0] = 1;
dp[1][1] = 1;
dp[1][2] = 0;
for (int i = 2; i <= s.size(); i++)
{
int pos = 0;
if (t[i] == t[i - 1])pos = i - 1;
else if (t[i] == t[i - 2])pos = i - 2;
for (int j = 0; j <= 2; j++)
{
dp[i][j] = (j ? dp[i - 1][j - 1] : 0) + dp[i - 1][j] - ((i-pos<=j&&pos)?dp[pos-1][j - (i - pos)]:0);
}
}
cout << dp[s.size()][2] + dp[s.size()][1] + 1;
return 0;
}