二叉树重建（uva 536）

#include <iostream>
#include <string>
using namespace std;
void postorder(string s1,string s2)
{
	int len1 = s2.find(s1[0]), len2 = s2.length() - len1 - 1;
	if(len1 != 0)postorder(s1.substr(1, len1), s2.substr(0, len1));
	if(len2 != 0)postorder(s1.substr(s1.length() - len2, len2), s2.substr(s2.length() - len2, len2) );	
	cout<<s1[0];
}
string preorder, inorder;
int main()
{
	while(cin>>preorder >>inorder)	
	{
		postorder(preorder, inorder);
		cout<<endl;
	}
	return 0;
}

来来来，还特么显示不了我就真的没办法了