许久的学习小窝

You are given n segments on a coordinate line; each endpoint of every segment has integer coordinates. Some segments can degenerate to points. Segments can intersect with each other, be nested in eac...

题目链接 Recently, you bought a brand new smart lamp with programming features. At first, you set up a schedule to the lamp. Every day it will turn power on at moment 0 and turn power off at moment M. Mor...

题目链接 L1 到 L2 之间连边权值 |C1−C2|  / √ A2+B2 线 L 与圆 i 之间连边权值 max(0, d(Oi , L1) − ri) 圆 i 与圆 j 之间连边权值 max(0, d(Oi , Oj ) − ri − rj ) 求 L1 到 L2 的最短路即可。   #include<bits/stdc++.h> #define ios1 ios::...