https://www.acmicpc.net/problem/6118코드#include #include #include using namespace std;#define MAX 20001int n, m, maxAns;int dst[MAX];vector v[MAX]; bool visit[MAX];void bfs() { queue q; q.push(1); visit[1] = true; dst[1] = 0; while (!q.empty()) { int now = q.front(); q.pop(); for (int i = 0; i > n >> m; for (int i = 0, a, b; i > a >> b; v[a].push_back(b); v[b].push_back(a); } bfs(); return 0..
