Facebook
From Coral Ibis, 6 Years ago, written in Plain Text.
Embed
Download Paste or View Raw
Hits: 259
  1. #include <iostream>
  2.  
  3. using namespace std;
  4.  
  5. int main(){
  6.         int n, w;
  7.     long long tmp, result;
  8.     cin>>n>>w;
  9.     long long x[n];
  10.     int y[n];
  11.     long long closest[n];
  12.        
  13.     for(int i = 0; i < n; i++)  cin>>x[i]>>y[i];
  14.    
  15.     result = 0;
  16.     for(int i = 0; i < n; i++){
  17.                 if(!closest[i]) closest[i] = w*1000000000*w*1000000000;
  18.         for(int j = i+1; j < n; j++){
  19.             tmp = (x[i]-x[j])*(x[i]-x[j]) + (y[i]-y[j])*(y[i]-y[j]);
  20.             if(tmp < closest[i])        closest[i] = tmp;
  21.             if(tmp < closest[j])        closest[j] = tmp;
  22.         }
  23.         if(closest[i] > result) result = closest[i];
  24.     }
  25.     cout<<result;
  26. }