假设它是⼆叉搜索树,⼀开始isMirror为FALSE,根据⼆叉搜索树的性质将已知的前序转换为后序,如果发现最后输出的后序数组⻓度不为n,那就设isMirror为true,然后清空后序数组,重新再转换⼀次,如果数组⼤⼩不等于n,就输出no否则输出yes
#include <cstdio>
#include <vector>
using namespace std;
bool isMirror;
vector<int> pre, post;
void getpost(int root, int tail){
if(root > tail) return ;
int i = root + 1, j = tail;
if(!isMirror){
while(i <= tail && pre[root] > pre[i]) i++;
while(j > root && pre[root] <= pre[j]) j--;
} else {
while(i <= tail && pre[root] <= pre[i]) i++;
while(j > root && pre[root] > pre[j]) j--;
}
if(i - j != 1) return ;
getpost(root + 1, j);
getpost(i, tail);
post.push_back(pre[root]);
}
int main() {
int n;
scanf("%d", &n);
pre.resize(n);
for(int i = 0; i < n; i++) scanf("%d", &pre[i]);
getpost(0, n - 1);
if(post.size() != n) {
isMirror = true;
post.clear();
getpost(0, n - 1);
}
if(post.size() == n) {
printf("YES\n%d", post[0]);
for(int i = 1; i < n; i++) printf(" %d", post[i]);
} else {
printf("NO");
}
return 0;
}