暴力双重循环#2TLE无需覆写算法解决方案

P1257 平面上的最接近点对

学学别人 $O(n^2)$ 过百万。
by __My0217__ @ 2023-05-27 16:36:05


不会吧,我java快读N^2都能过 [本人java测试记录](https://www.luogu.com.cn/record/113022342)
by Molie @ 2023-06-20 12:13:17


妙啊
by Doppler @ 2023-07-03 20:31:27


@[KirenWinter](/user/886490) 6啊6啊,我刚想发帖问
by 1_1_1_1_1_1_ @ 2023-08-16 22:45:21


@[KirenWinter](/user/886490) 太妙了
by 1_1_1_1_1_1_ @ 2023-08-16 22:45:54


PYTHON大法 ```c #include<iostream> #include<math.h> using namespace std; long long a[99999999],b[99999999]; double kill,l=99999999999; int main(){ int i,j,n; cin>>n; for(i=1;i<=n;i++){ cin>>a[i]>>b[i]; } for(i=1;i<n;i++) for(j=i+1;j<=n;j++){ kill=sqrt((a[j]-a[i])*(a[j]-a[i])+(b[j]-b[i])*(b[j]-b[i])); if(l>kill)l=kill; } printf("%.4lf",l); } ```
by IMPOSTORrrrrrr @ 2023-09-11 21:00:07


@[IMPOSTORrrrrrr](/user/1067755) 看運行速度就知道爲什麽這麽説了
by IMPOSTORrrrrrr @ 2023-09-11 21:00:44


好有道理的鸭子…… 实践ing……
by THE_Epsilon @ 2023-11-15 20:23:23


不用o2也a了!!!太6了!
by THE_Epsilon @ 2023-11-15 20:50:46


|