@[zhang3_2022](/user/756660) 蒟蒻没做此题，仅看代码提出以下建议：
```cpp
void dfs(int x, int len){
ans = max(len , ans);
for(int i = head[x]; i ;i = edge[i].nxt){
if(!vis[edge[i].ver]) {
vis[edge[i].ver] = 1;
dfs(edge[i].ver , len + s[edge[i].ver].size());
vis[edge[i].ver] = 0;
}
}
}
```
by best_brain @ 2023-05-17 21:08:34
@[biran](/user/485033) 感谢， 但是T + WA了，但还是感谢
by B612Dusk @ 2023-05-17 21:18:42