func_code_string: #include <bits/stdc++.h>   using namespace std;   int n, arr[300000];   double cord[3], best[3];   int main() {     cin >> n;     for (int i = 0; i < n; i++) scanf( %d , &arr[i]);     sort(arr, arr + n);     int l = 0, r = 2000000000, res = -1;     while (l <= r) {       int mid = (l + r) / 2;       int idx = 0;       for (int i = 0; i < 3; i++) {         cord[i] = (double)arr[idx] + (double)mid / 2.;         while (idx < n && abs(arr[idx] - cord[i]) - 1e-7 < (double)mid / 2.)           idx++;       }       if (idx == n) {         for (int i = 0; i < 3; i++) best[i] = cord[i];         res = mid, r = mid - 1;       } else         l = mid + 1;     }     printf( %.6lf n , (double)res / 2.);     printf( %.6lf  , (double)best[0]);     for (int i = 1; i < 3; i++) printf( % .6lf , (double)best[i]);     cout << endl;     return 0;   }   