例题6-17 UVa10562-Undraw the Trees

将每次的输入全部读取到二维数组中，在第一行找到根结点开始进行先序遍历即可。注意括号的输出和换行符。

题目链接：UVa 10562

AC代码：

#include 
#include 
#include 
using namespace std;
//#define DEBUG
//#ifdef DEBUG
//#include 
//#define cout out
//ofstream out("C:\\Users\\Acer\\Desktop\\1.txt");
//#endif // DEBUG


const int maxn = 200 + 10;
char tree[maxn][maxn];
set<char> symbol = { '|',' ','-','#'};  //不能成为结点标签的字符
int n;

void dfs(int r,int c) {
	cout << tree[r][c] << "(";
	if (r+1<n && tree[r + 1][c] == '|') {
		int i = c;
		while (i - 1 >= 0 && tree[r + 2][i - 1] == '-' ) i--;
		while (tree[r + 2][i] == '-' && tree[r + 3][i]!='\n') {
			if(!symbol.count(tree[r+3][i]))
				dfs(r + 3, i);
			i++;
		}
	}
	cout << ")";
}
int main() {
	int T;
	string line;
	cin >> T;
	getchar();
	while (T--) {
		n = 0;
		for (;;) {
			fgets(tree[n], maxn, stdin);
			if (tree[n][0] == '#') break;
			n++;
		}
		cout << "(";
		for (int i = 0; i < strlen(tree[0])-1; i++) {
			if (!symbol.count(tree[0][i])) {
				dfs(0, i);
				break;
			}
		}
		cout << ")" << endl;
	}
	return 0;
}