为什么会出故障

P1030 [NOIP2001 普及组] 求先序排列

点插入代码
by tumu1t @ 2018-12-18 17:43:57


```cpp include<iostream> include<cstdio> include<cstring> using namespace std; char a1[10],t1[1<<10],a2[10]; void work(int L1,int R1,int L2,int R2,int root) { if(L1>R1)return; for(int i=L1; i<=R1; i++) { if(a1[i]==a2[R2]) { t1[root]=a2[R2]; int ct=i-L1; work(L1,i-1,L2,L2+ct-1,root2); work(i+1,R1,L2+ct,R2-1,root2+1); break; } } return; } void PreOrder(int cur) { if(t1[cur]=='0')return; cout<<t1[cur]; PreOrder(2cur); PreOrder(2cur+1); return; } int main() { freopen("testdata.in","r",stdin); //freopen("testdata2.out","w",stdout); memset(t1,'0',sizeof(t1)); int n=1; while(cin>>a1[n])n++; for(int i=1;i<n;i++)cin>>a2[i]; work(0,n-1,0,n-1,1); PreOrder(1); fclose(stdin); //fclose(stdout); return 0; } ```
by jc2018 @ 2018-12-18 18:03:40


|