#include iostreamusing namespace std;string a,b;void f(string cx,string zx){if(zx.size()==0) return ;char root=cx[0];int rootid=zx.find(root);string lzx=zx.substr(0,rootid);string rzx=zx.substr(rootid+1);string lcx="",rcx="";for(int i=1;cx[

点我呐

#include iostream#include cmathusing namespace std;int de,m,maxi;bool tree[1024*1024+50]={};//默认全是0int tra(int i){ int j=i; if(tree[i]==false){ tree[i]=true; j=2*i; } else if(tree[i]==true){ tree[i]=false; j=2*i+1; } if(jmaxi) retur

点我呐

#include iostreamusing namespace std;string a,b;void f(string xx,string zx){if(xx.size()==0) return ;char root=xx[0];int rootid=zx.find(root);string lzx=zx.substr(0,rootid);string rzx=zx.substr(rootid+1);string lxx=xx.substr(1,rootid);strin

点我呐

#include iostreamusing namespace std;/*先序 gzzzzzyyy1,mid mid+1中序 zzzzzgyyy0,mid mid+1后序 zzzzzyyyg0,mid mid,zxr.size()*/string xx,zx;void findtree(string xx,string zx){if(xx.size()==0||zx.size()==0) return ;int mid=zx.find(xx[0])

点我呐

#includebits/stdc++.husing namespace std;int n,ans;string s[10000];int main(){ while(cins[n++]);//将所有的字符串出入(结尾加上CTRL+Z)n--;sort(s,s+n);//将所有的字符串按照顺序排序ans=s[0].size();for(int i=1;in;i++){in

点我呐

#include bits/stdc++.husing namespace std;int main(){vectorstring v;string s;while(cins) v.push_back(s); sort(v.begin(),v.begin()+v.size());int ans=v[0].size()+1;for(int i=1;iv.size();i++){int j=0;while(jv[i].size()v[i][j]==v[i-1][j]) j++;a

点我呐

#include iostream#include setusing namespace std;setstring s;int geti(string a,string b){for(int i=0;ia.size();i++){if(a[i]!=b[i]) return i;}return a.size();}int main(){//freopen("file.in","r",stdin); string t; while(cint){ s.insert(t); }se

点我呐

#include iostream#include cstring#include algorithmusing namespace std;int tree[105],n,m,x,y;int par[105];int root,maxn;int main(){memset(tree,-1,sizeof(tree));//fill(tree,tree+105,-1); cinnm;while(m--){cinxy;tree[y]=x;par[x]++;if(par[maxn]

点我呐

#include iostream#include mapusing namespace std;int main(){ int a[105]={};int n,m,x,y;mapint,int mp;cinnm;while(m--){cinxy;if(mp[x]) mp[x]++;else mp[x]=1;a[y]=x;}int root=1;while(a[root]!=0) root=a[root];int maxt=0,maxr=0;for(int i=1;i=n;i

点我呐

#include iostreamusing namespace std;char c[100050];void createnode(int i){char a;cina;if(a=='.'){return ;}else{c[i]=a;createnode(2*i);createnode(2*i+1);}}void zx(int i){if(c[i]){zx(i*2);coutc[i];zx(i*2+1);}}void hx(int i){if(c[i]){hx(i*2);

点我呐