//UPDATERA ARRAY STORLEKEN!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! #include <bits/stdc++.h> using namespace std; typedef long long ll; const ll INF=1e15; const ll MAXN=200006;//UPDATERA ARRAY STORLEKEN!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! ll n; double ans[MAXN]; struct node{ double x,r; }lst[MAXN]; stack<ll> S; int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cin>>n; for(int i=1;i<=n;i++){ cin>>lst[i].x>>lst[i].r; ans[i]=lst[i].r; } cout<<setprecision(20); for(int i=1;i<=n;i++){ while(!S.empty()){ ans[i]=min((lst[S.top()].x-lst[i].x)*(lst[S.top()].x-lst[i].x)/(4.0*ans[S.top()]),ans[i]); if(ans[i]>=ans[S.top()]){ S.pop(); }else break; } S.push(i); cout<<ans[i]<<'\n'; } }