Luogu P2179. [NOI2012] Cycling in Sichuan and Tibet
Original link: https://www.shuizilong.com/house/archives/luogu-p2179-noi2012-%E9%AA%91%E8%A1%8C%E5%B7%9D%E8%97%8F/ https://www.luogu.com.cn/problem/P2179 In the case of the optimal solution, the derivative of each component is the same, and the derivative can be divided into two. #include <lastweapon/io> using namespace lastweapon; const int N = int(1e4) + 9; int n; double e, s[N], k[N], u[N]; double calcV(double x, int i) { double l = […]
Luogu P2179. [NOI2012] Cycling in Sichuan and Tibet Read More »