51nod1464(trie + dfs)

 1 #include <iostream>
 2 #include <stdio.h>
 3 #include <string.h>
 4 using namespace std;
 5 
 6 const int MAXN = 5e3 + 10;
 7 int trie[MAXN * MAXN][2], num[MAXN * MAXN], id = 1;
 8 bool dp[MAXN][MAXN];//dp[i][j]存储[i,j] 是否为半回文串
 9 int vis[MAXN];//vis[i]存储以i开始的最长半回文串末尾位置
10 char s[MAXN];
11 
12 void init(int len){
13     for(int i = len - 1; i >= 0; i--){
14         vis[i] = i;
15         dp[i][i] = true;
16         for(int j = i + 1; j < len; j++){
17             if(s[i] == s[j]){
18                 if(i + 2 >= j - 2) dp[i][j] = true;
19                 else dp[i][j] = dp[i + 2][j - 2];
20             }
21             if(dp[i][j]) vis[i] = j;
22         }
23     }
24 }
25 
26 void insert(int st){
27     int node = 0;
28     for(int i = st; i <= vis[st]; i++){
29         int cnt = s[i] - ‘a‘;
30         if(!trie[node][cnt]) trie[node][cnt] = id++;
31         if(dp[st][i]) num[trie[node][cnt]]++;
32         node = trie[node][cnt];
33     }
34 }
35 
36 int k;
37 string sol;
38 
39 void dfs(int x){
40     string cnt = sol;
41     if(k > 0 && trie[x][0]){
42         sol += ‘a‘;
43         k -= num[trie[x][0]];
44         dfs(trie[x][0]);
45     }
46     if(k > 0 && trie[x][1]){
47         sol = cnt;
48         sol += ‘b‘;
49         k -= num[trie[x][1]];
50         dfs(trie[x][1]);
51     }
52 }
53 
54 int main(void){
55     scanf("%s%d", s, &k);
56     int len = strlen(s);
57     init(len);
58     for(int i = 0; i < len; i++){
59         insert(i);
60     }
61     dfs(0);
62     cout << sol << endl;
63     return 0;
64 }