문제 링크 : boj.kr/13005난이도 : P4태그 : 트리, DFS코드#include #define all(x) (x).begin(), (x).end()#define INF 0x7FFFFFFFusing namespace std;using ll = long long;using ld = long double;using pii = pair;using pll = pair;struct node { int idx; ll m_dist; ll dist;};int main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; vector num(n+1); for(int i = 1; i > num[..