UVA - 10562 Undraw the Trees

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
char map[500][500];
void dfs(int n, int l, int r) {
printf("(");
for (int i = l; i < r; i++) {
if (map
[i] != ' ' && map
[i] != '#' && map
[i] != '\0') {
printf("%c", map
[i]);
if (map[n+1][i] == '|') {
int lef = i, rig = i;
while (map[n+2][lef] == '-') lef--;
while (map[n+2][rig] == '-') rig++;
if (lef < 0) lef = 0;
dfs(n+3, lef, rig);
}
else printf("()");
}
}
printf(")");
}
int main() {
int T;
scanf("%d", &T);
getchar();
while (T--) {
memset(map, 0, sizeof(map));
int n = 0;
while (gets(map
)) {
if (map
[0] == '#') break;
n++;
}
dfs(0, 0, strlen(map[0]));
printf("\n");
}
return 0;
}