UVA - 10562 Undraw the Trees（看图写树 不用建树）

#include<cstdio>
#include<cstdlib>
#include<string>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<set>
#include<map>
#include<vector>
#include<list>
#include<deque>
#include<queue>
#include<cmath>
using namespace std;
const int maxn = 210;
char s[maxn][maxn];
char ans[10000];
int cur,d;
void dfs(int deep, int left, int right)
{
if (deep > d) return;
for(int i = left; i <= right; i++)
{
if((i<strlen(s[deep])) && s[deep][i] != '|' && s[deep][i] != '-' && s[deep][i] != ' ' && s[deep][i] != '#')
{
ans[cur++] = s[deep][i];
ans[cur++] = '(';
if(s[deep + 1][i] == '|')
{
int l = i, r = i;
while(s[deep + 2][l] == '-') l--;
while(s[deep + 2][r] == '-') r++;
dfs(deep + 3, l + 1, r - 1);
ans[cur++] = ')';
}
else ans[cur++] = ')';
//cout << "**" << s[deep][i] << " ** " << i << endl;
}
}
return;
}
int main()
{
int t;
scanf("%d",&t);
getchar();
while(t--)
{
d = 0;
while(gets(s[d]))//读取树存放在二维数组里
{
if(s[d][0] == '#') break;
d++;
}
cur = 0;
ans[cur++] = '(';
dfs(0, 0, strlen(s[0]) - 1);
ans[cur++] = ')';
ans[cur] = 0;
printf("%s\n",ans);
}
return 0;
}

/*

2
A
|
--------
B  C   D
|   |
----- -
E   F G
#
e
|
----
f g
#

*/