PAT | T1025 Keep at Most 100 Characters

动态规划dp

#include <iostream>
#include <string>
#include <unordered_set>

using namespace std;

typedef long long ll;
const int mod = 1000000007;

ll dp[110][1010]; // dp[i][j] : s[0...j]长度为i的子串个数
ll num[26]; // num[k] : 在长度为i的子串中，以字母X(num['X' - 'a'])结尾的子串个数

int main(){
	string s;
	cin>>s;
	int len = s.length();
	unordered_set<char> appear;
	for(int i = 0;i < len;i++){
		if(appear.find(s[i]) == appear.end()){
			appear.insert(s[i]);
			dp[1][i] = appear.size();
		}else{
			dp[1][i] = dp[1][i - 1];
		}
	}
	for(int i = 2;i <= min(100,len);i++){
		fill(num,num + 26,0);
		for(int j = 1;j < len;j++){
			dp[i][j] = (dp[i][j - 1] + dp[i - 1][j - 1] - num[s[j] - 'a'] + mod) % mod;
			num[s[j] - 'a']  = dp[i - 1][j - 1];
		}
	}
	ll res = 0;
	for(int i = 1;i <= min(len,100);i++){
		res = (res + dp[i][len - 1]) % mod;
	}
	printf("%lld",res);
	system("pause");
	return 0;
}