Pagini recente » Cod sursa (job #2899753) | Cod sursa (job #2801753) | Cod sursa (job #20317) | Cod sursa (job #628515) | Cod sursa (job #3320787)
#include <fstream>
#include <iomanip>
#include <deque>
#define int long long
using namespace std;
ifstream cin("secv3.in");
ofstream cout("secv3.out");
double v[30005];
double d[30005];
deque <int> dq;
signed main()
{
double mx=0;
int n, l, r, a;
cin>>n>>l>>r;
for(int i=1; i<=n; i++)
{
cin>>v[i];
v[i]+=v[i-1];
}
for(int i=1; i<=n; i++)
{
cin>>d[i];
d[i]+=d[i-1];
}
for(int k=l; k<=r; k++)
{
dq.clear();
mx=max(mx, v[k]/d[k]);
for(int i=k; i<n; i++)
{
while(!dq.empty() && dq.front()<=i-k)
{
dq.pop_front();
}
while(!dq.empty() && (v[dq.back()]-v[dq.front()-k])/(d[dq.back()]-d[dq.front()-k])<(v[i]-v[i-k])/(d[i]-d[i-k]))
{
dq.pop_back();
}
dq.push_back(i);
mx=max(mx, (v[dq.back()]-v[dq.front()-k])/(d[dq.back()]-d[dq.front()-k]));
}
}
cout<<fixed<<setprecision(2)<<mx;
return 0;
}