Luogu P1030 求先序排列

给出中序遍历和后序遍历，求先序遍历

InOrder是左根右， PostOrder是左右根，那么区间内后序遍历的最后一个元素就是根节点了，压入PreOrder，然后查找该值在InOrder中的位置，便能分开左右子树， 进行递归处理，直到没有元素或元素数为1

#include <iostream>
#include <cstdio>
#include <string>

std::string pre, in, post;

void read_data(void);
void calc(const int li, const int ri, const int lp, const int rp);

int main() {
	read_data();
	calc(0, in.size()-1, 0, post.size()-1);
	std::cout << pre;
	//system("pause");
	return 0;
}

void read_data(void) {
	std::cin >> in >> post;
}
// call itself until the num of the element of the subtree equals 1, then push it in, or equals 0, skip
void calc(const int li, const int ri, const int lp, const int rp) { 
	char rootVal = post[rp];
	int midPos = in.find(rootVal);
// root
	pre += rootVal;    
// left subtree
	if (midPos == li+1)    
		pre += in[li];    
	else if (midPos != li)
		calc(li, midPos-1, lp, lp+midPos-1-li);
// right subtree
	if (midPos == ri-1)
		pre += in[ri];
	else if (midPos != ri)
		calc(midPos+1, ri, rp-(ri-midPos), rp-1);

	return;
}