PTA - 至多删三个字符(dp)

题目link

思路

考虑$dp[i][j]$ 前$i$个字符删去$j$个的方案数
不考虑重复
$dp[i][j]=dp[i-1][j](不取第i个)+dp[i-1][j-1](取第i个)$

如何去重呢？
对于当前枚举的位置 $i$ ， 若在$i$前存在位置 $k$ 使得 $s[i]=s[k]$, 那么对于当前枚举的j
若 $j>=i-k$,则说明在区间$[k,i-1]$和$[k-1,i]$删去$j$个的方案相同,那么只需要减去状态 $f[k-1][j-(i-k)]$

code

/*
    *@author:bzdhxs
    *@date:2022/03/19
    *@URL:https://blog.csdn.net/qq_39826163/article/details/88789257?ops_request_misc=%257B%2522request%255Fid%2522%253A%2522164765339716782089393468%2522%252C%2522scm%2522%253A%252220140713.130102334.pc%255Fall.%2522%257D&request_id=164765339716782089393468&biz_id=0&utm_medium=distribute.pc_search_result.none-task-blog-2~all~first_rank_ecpm_v1~rank_v31_ecpm-9-88789257.142^v2^pc_search_result_cache,143^v4^register&utm_term=+%E8%87%B3%E5%A4%9A%E5%88%A0%E4%B8%89%E4%B8%AA%E5%AD%97%E7%AC%A6+%2835+%E5%88%86%29&spm=1018.2226.3001.4187

    字符串线性
*/
#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 long long
#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;
int pri[16] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53};
const int inf = 0x3f3f3f3f;
const int INF = ~0ULL;
const int N = 1e6+10;

char s[1000005];

int f[1000005][4];
signed main()
{
    scanf("%s",s+1);
    int len = strlen(s+1);
    f[0][0] = 1;
    forr(i,1,len){
        forr(j,0,3){
            f[i][j] += f[i-1][j];
            if(j) f[i][j] += f[i-1][j-1];

            for(int k = i-1;k&&j>=(i-k);k--){
                if(s[i] == s[k]){
                    f[i][j] -= f[k-1][j-(i-k)];
                    break;
                }

            }
        }
    }
    cout << f[len][0]+f[len][1]+f[len][2]+f[len][3] << endl;
    return 0;
}