1266

On a 2D plane, there are n points with integer coordinates points[i] = [xi, yi]. Return the minimum time in seconds to visit all the points in the ord ......

[原题](https://codeforces.com/problemset/problem/1266/D) [翻译](https://www.luogu.com.cn/problem/CF1266D) 其实这题的翻译反而不如原题好理解，建议先阅读原题后重新思考做法 $$ \large{\color ......