HDU-1710 Binary Tree Traversals 二叉树遍历

#include<stdio.h>
#include<iostream>
#include<string>
#include<string.h>
#include<math.h>
#include<functional>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
const int maxn =1005;
const int inf = 1<<30;//0x7f;
typedef __int64 LL;
int n;
int pre[maxn],addr[maxn],num[maxn],index,flag;
void DFS( int s,int e )
{
int t = index;
if( s < addr[pre[t]] )
index ++,DFS( s,addr[pre[t]]-1 );
if( e > addr[pre[t]] )
index ++,DFS( addr[pre[t]]+1,e );
if( !flag++ )	printf("%d",pre[t]);
else printf(" %d",pre[t]);
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("data.txt","r",stdin);
#endif
while( scanf("%d",&n) != EOF )
{
for( int i = 1; i <= n; i ++ )
scanf("%d",&pre[i]);
for( int i = 1; i <= n; i ++ ){
scanf("%d",&num[i]);
addr[num[i]] = i;
}
index = 1,flag = 0;
DFS(1,n);
puts("");
}
return 0;
}