//#pragma GCC optimize("O3,unroll-loops") #include<iostream> #include<vector> #include<string> #include<algorithm> #include<set> #include<unordered_set> #include<numeric> #include<map> #include<unordered_map> #include<queue> #include<stack> #include<math.h> #include<iomanip> #include<array> #include<climits> #include<assert.h> //#include<bits/stdc++.h> //#include<ext/pb_ds/assoc_container.hpp> //#include<ext/pb_ds/tree_policy.hpp> #define ll long long #define ld long double #define str string #define ins insert #define fi first #define se second #define pb push_back #define pii pair<int,int> #define pll pair<ll,ll> #define sqr(x) (x)*(x) using namespace std; // using namespace __gnu_pbds; // template <typename T> // using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; void solve() { int n; cin >> n; vector<ld> x(n), r(n); for (int i=0; i<n; i++) { cin >> x[i] >> r[i]; } stack<int> st; st.push(0); for (int i=1; i<n; i++) { while (!st.empty()) { int t=st.top(); ld dx=x[i]-x[t]; ld ri=(sqr(dx))/(ld)((ld)4*r[t]); if (ri>r[i]) { if (r[t]<r[i]) st.pop(); else break; } else { r[i]=ri; if (r[t]<r[i]) st.pop(); else break; } } st.push(i); } for (int i=0; i<n; i++) { cout << r[i] << "\n"; } } int main() { //freopen("promote.in", "r", stdin); //freopen("promote.out", "w", stdout); ios::sync_with_stdio(0); cin.tie(0); int tt=1; //cin >> tt; cout << fixed << setprecision(3); for (int i=1; i<=tt; i++) { //cout << "Case#" << i << ":\n"; solve(); } return 0; }