思路:根据求ne数组来反着推文本串
方法:先找不能作为pre[i]的前面的字母,将其标记,最后遍历26个字母,未被标记就选择;
code:
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
const int N = 1e6 + 10;
char str[N];
int ne[N], st[N];
int main() {
int n;
cin >> n;
ne[0] = -1;
for (int i = 1; i <= n; i++) {
int t;
cin >> t;
ne[i] = i - t;
if (ne[i]) {
str[i] = str[ne[i]];//倒推ne数组
} else {
int j = ne[i - 1];
while (j >= 0) st[str[j + 1] - 'a'] = i, j = ne[j];//倒推ne数组,标记已被选择的字母
for (int k = 0; k < 26; k++) {
if (st[k] != i) {
str[i] = k + 'a';//已解释
break;
}
}
}
}
for (int i = 1; i <= n; i++) cout << (char)str[i];
return 0;
}