#include <bits/stdc++.h>
using namespace std;
/******* All Required define Pre-Processors and typedef Constants *******/
typedef pair<int,int> pii;
#define fastIO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define sz(x) (int)(x).size()
#define all(x) x.begin(),x.end()
#define sor(x) sort(all(x))
#define rsz resize
#define ins insert
#define ft front()
#define bk back()
#define pb push_back
#define eb emplace_back
#define pf push_front
#define ll long long
#define numBit(x) __builtin_popcount(x)
#define lb lower_bound
#define ub upper_bound
#define ar array
#define endl '\n'
#define fi first
#define se second
const int inf = 1e9+1;
const int maxN = 2e5 + 1;
const int MOD = 1e9 + 7;
using namespace std;
ll powmod(ll a, ll b, ll p){
a %= p;
if (a == 0) return 0;
ll product = 1;
while(b > 0){
if (b&1){
product *= a;
product %= p;
--b;
}
a *= a;
a %= p;
b /= 2;
}
return product;
}
ll inv(ll a, ll p){
return powmod(a, p-2, p);
}
ll DIVMOD(ll a, ll b, ll p){
// A*(B^(MOD-2))%MOD
return a*inv(b,p)%p;
}
void file(const string FILE = "bongbong") {
//freopen((FILE + ".INP").c_str(), "r", stdin);
//freopen((FILE + ".OUT").c_str(), "w", stdout);
}
int n;
long double x[maxN];
long double r[maxN],pck[maxN];
void solve(){
stack<int> st;
cin>>n;
for(int i=0;i<n;i++){
cin>>x[i]>>r[i];
}
for(int i=0;i<n;i++){
while(!st.empty()){
int j=st.top();
r[i]=min(r[i],(x[i]-x[j])*(x[i]-x[j]))/(4.0*r[j]));
if(r[i]>=r[j]) st.pop();
else break;
}
st.push(i);
//cout<<ans<<setprecision(3)<<endl;
printf("%.3Lf \n", pck[i]);
}
}
int main()
{
//file();
fastIO;
int t=1;
//cin>>t;
while(t--)
solve();
return 0;
}
Compilation message
bal.cpp: In function 'void solve()':
bal.cpp:73:62: error: expected ';' before ')' token
73 | r[i]=min(r[i],(x[i]-x[j])*(x[i]-x[j]))/(4.0*r[j]));
| ^
| ;
