Sherlock and MiniMax Discussions | Algorithms | HackerRank
We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
usingnamespacestd;#define ll long long intvoidsolve(){lln,p,q,pMin=(1LL<<40),qMin=(1LL<<40),maxDif=0,ans=-1;cin>>n;vector<ll>ar(n,0);for(lli=0;i<n;i++)cin>>ar[i];sort(ar.begin(),ar.end());cin>>p>>q;ans=p;for(autoit:ar)pMin=min(pMin,abs(it-p)),qMin=min(qMin,abs(it-q));for(lli=0;i<n-1;i++){llmid=(ar[i]+ar[i+1])/2;if(mid>=p&&mid<=q&&maxDif<min(mid-ar[i],ar[i+1]-mid)){maxDif=min(mid-ar[i],ar[i+1]-mid),ans=mid;}}if(pMin>=maxDif)ans=p,maxDif=pMin;if(qMin>maxDif)ans=q,maxDif=qMin;cout<<ans<<endl;}intmain(){llt=1;// cin>>t;while(t--)solve();return0;}
Sherlock and MiniMax
You are viewing a single comment's thread. Return to all comments →