7-7 目录树

#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<map>
#include<algorithm>
using namespace std;
int cnt,N;
struct Node{
	int num;
	string s;
	vector<int>m;
	vector<int>n;
	map<string,int>m1;
	map<string,int>n1;
}tree[100005];
bool cmp(int a,int b)
{
	return tree[a].s<tree[b].s;
}
void dfs(int x,int ans)
{
	for(int i=1;i<=ans;i++)
	putchar(' ');
	cout<<tree[x].s;
	sort(tree[x].m.begin(),tree[x].m.end(),cmp);
	sort(tree[x].n.begin(),tree[x].n.end(),cmp);
	for(int i=0;i<tree[x].m.size();i++)
	{
		cout<<endl;
		dfs(tree[x].m[i],ans+2);
	}
	for(int i=0;i<tree[x].n.size();i++)
	{
		cout<<endl;
		dfs(tree[x].n[i],ans+2);
	}	
}
int main()
{
//	freopen("1.txt","w",stdout);
	string s;
	cin>>N;
	tree[0].s="root";
	for(int i=1;i<=N;i++)
	{
		getchar();
		cin>>s;
		int last=0,lnode=0;
		for(int j=0;j<s.size();j++)
		{
			if(s[j]=='\\')
			{
				string str=s.substr(last,j-last);
				last=j+1;
				if(!tree[lnode].m1[str])
				{
					tree[lnode].m1[str]=++cnt;
					tree[lnode].m.push_back(cnt);
					tree[cnt].s=str;
				}
				lnode=tree[lnode].m1[str];
			}
		}
		if(last!=s.size())
		{
			string str=s.substr(last,s.size()-last);
			tree[lnode].n1[str]=++cnt;
			tree[lnode].n.push_back(cnt);
			tree[cnt].s=str;
		}
	}
	dfs(0,0);
	return 0;
}