Pagini recente » Cod sursa (job #2490684) | Cod sursa (job #674886) | Cod sursa (job #486899) | Cod sursa (job #1607152) | Cod sursa (job #3315641)
#include <bits/stdc++.h>
#define NMAX 30000
#define LOG 19
#define ll long long int
#define MOD 1000000007
#define EPS 0.01
using namespace std;
ifstream fin("secv3.in");
ofstream fout("secv3.out");
int v[NMAX+1], t[NMAX+1];
int n,l,u;
bool check(double S)
{
deque<int> dq;
vector<double> d(n+1,0);
for(int i=1;i<=n;i++)
{
d[i] = v[i] - t[i] * S;
d[i] += d[i-1];
}
bool ok=0;
for(int i=l;i<=n;i++)
{
while(!dq.empty() && d[dq.back()]-d[i-l] >= EPS)
{
dq.pop_back();
}
dq.push_back(i-l);
if(!dq.empty() && dq.front() < i-u)
{
dq.pop_front();
}
ok |= d[i] - d[dq.front()] >= EPS;
}
return ok;
}
int main()
{
fin >> n >> l >> u;
for(int i=1;i<=n;i++)
{
fin >> v[i];
}
for(int i=1;i<=n;i++)
{
fin >> t[i];
}
double st=0,dr=1000;
while(dr-st>=EPS)
{
double m = ceil((st+dr)/2 * 100) / 100;
if(check(m))
{
st=m+EPS;
}
else
{
dr=m-EPS;
}
}
fout << dr;
}