#include <bits/stdc++.h> typedef long long ll; typedef long double ld; using namespace std; #include <ext/pb_ds/assoc_container.hpp> using namespace __gnu_pbds; typedef tree<pair<int,int>,null_type,less<pair<int,int>>,rb_tree_tag, tree_order_statistics_node_update> indexed_set; int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin>>n; ld a[n]; ld r[n]; vector<pair<ld,ld>> s; for(int i=0;i<n;i++){ cin>>a[i]; ld l; cin>>l; if(i==0){ r[i]=l; } else{ r[i]=l; while(s.size()){ r[i]=min(r[i],((a[i]-s.back().first)*(a[i]-s.back().first))/(4*s.back().second)); if(s.back().second<=r[i]){ s.pop_back(); } else{ break; } } } s.push_back({a[i],r[i]}); cout<<fixed<<setprecision(3)<<r[i]<<endl; } }