fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3.  
  4. #define ms(s,n) memset(s,n,sizeof(s))
  5. #define all(a) a.begin(),a.end()
  6. #define present(t, x) (t.find(x) != t.end())
  7. #define sz(a) int((a).size())
  8. #define FOR(i, a, b) for (int i = (a); i < (b); ++i)
  9. #define FORd(i, a, b) for (int i = (a) - 1; i >= (b); --i)
  10. #define pb push_back
  11. #define pf push_front
  12. #define fi first
  13. #define se second
  14. #define mp make_pair
  15.  
  16. typedef long long ll;
  17. typedef unsigned long long ull;
  18. typedef long double ld;
  19. typedef pair<int,int> pi;
  20. typedef vector<int> vi;
  21. typedef vector<pi> vii;
  22.  
  23. const int MOD = (int) 1e9+7;
  24. const int INF = (int) 1e9+1;
  25. inline ll gcd(ll a,ll b){ll r;while(b){r=a%b;a=b;b=r;}return a;}
  26. inline ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
  27.  
  28.  
  29. void FileIO(){
  30. freopen("input.txt","r", stdin);
  31. freopen("output.txt","w",stdout);
  32. }
  33.  
  34. int main(){
  35. //FileIO();
  36. int n,l;cin>>n>>l;
  37. vi a;
  38. FOR(i,0,n){
  39. int x;cin>>x;
  40. a.pb(x);
  41. }
  42. sort(all(a));
  43. double res=max(a[0]-0,l-a[n-1]);
  44. for(int i=0;i<n-1;i++){
  45. res=max(res,(double)(a[i+1]-a[i])/2);
  46. }
  47. cout<<fixed<<setprecision(10)<<res<<endl;
  48. }
Success #stdin #stdout 0.01s 5592KB
stdin
Standard input is empty
stdout
22021.0000000000