https://atcoder.jp/contests/typical90/tasks/typical90_c要は、木の径（+1）を求める問題ですね。 // Longest Circular Road #![allow(non_snake_case)] use std::collections::VecDeque; //////////////////// library //////////////////// fn read<T: std::str::FromStr>() -></t:>…