1860E
CF1860E
[原题](https://codeforces.com/contest/1860/problem/E?mobile=false) [翻译](https://www.luogu.com.cn/problem/CF1860E) 首先考虑一个暴力的做法,暴力建图,对每一个询问跑BFS,总复杂度$O(n^2 ......
CodeForces 1860E Fast Travel Text Editor
[洛谷传送门](https://www.luogu.com.cn/problem/CF1860E "洛谷传送门") [CF 传送门](https://codeforces.com/problemset/problem/1860/E "CF 传送门") 没场切。/ng 考虑将原问题转成: > 给长度为 ......