UVA 10562 - Undraw the Trees

很是艰难，写完后看别人的代码都是直接dfs,而没有直接建树，我一开始就想的是先建立树，而后dfs，虽然结果是AC了可是复杂了不少。

要好好体会。

#include <iostream>
#include <cstring>
#include <cstdio>
#include <cctype>
#include <string>
#include <functional>
#include <algorithm>

using namespace std;

const int size = 10000 + 50;
const int str_size = 200 + 100;

int cur;
char tree[size];
int x[size] , y[size];

void f(int now)
{
	if(now == -1) return;
	cout << tree[now];

	cout << "(";
	f(x[now]);
	cout << ")";
	f(y[now]);
}

int main()
{
	int n , cnt = 0;
	cin >> n; getchar();
	
	while(cnt < n)
	{
		char str[str_size] , pre[str_size];
		int  u[str_size] , u_num = 0;
		int  v[str_size] , v_num = 0;
		int  w[str_size];
		
		cur = 0;
		memset(x , -1 , sizeof(x));
		memset(y , -1 , sizeof(y));
		
		pre[0] = 0;
		while(fgets(str , str_size , stdin) && str[0] != '#')
		{
			int len = strlen(str);
			str[len-1] = 0;
			auto iter = find_if(str , str+len-1 , bind2nd(not_equal_to<char>() , ' '));
			if(iter == str+len-1) continue;
			
			if(*iter == '|')
			{
				for(char *p = iter ; *p ; ++p)
					if(*p == '|') u[u_num++] = w[p-str];
			}
			else if(*iter == '-')
			{
				int ok = 0;
				char *p;
				for(p = iter ; *p ; ++p)
				{
					if(*p == '-') { ok = 1; }
					else if(ok) { ok = 0 ; v[v_num++] = p - str;}
				}
				if(ok) { v[v_num++] = p - str; }
			}
			else
			{
				if(!pre[0])
				{
					w[iter-str] = cur;
					tree[cur++] = *iter;
				}
				else
				{
					int i = 0;
					for(char *p = iter ; *p ; ++p)
					{
						if(!isspace(*p))
						{
							int t = p - str;
							w[t] = cur; 
							tree[cur++] = *p;
							if(t >= v[i]) ++i;
							if(x[u[i]] == -1) x[u[i]] = w[t];
							else{
								int q = x[u[i]];
								while(y[q] != -1)
									q = y[q];
								y[q] = w[t];
							}
						}
					}
				}
				u_num = v_num = 0;
			}
			strcpy(pre , str);
		}
		
		cout << "(";
		if(cur) f(0);
		cout << ")" << endl;
		
		++cnt;
	}
	return 0;
}