Pagini recente » Cod sursa (job #848377) | Cod sursa (job #1057123) | Cod sursa (job #290964) | Cod sursa (job #452136) | Cod sursa (job #1691130)
#include <iostream>
#include <fstream>
#include <iomanip>
#define NMAX 3005
using namespace std;
ifstream f("secv3.in");
ofstream g("secv3.out");
int n,l,u,cost[NMAX],timp[NMAX],ind[NMAX];
double s[NMAX],d[NMAX];
bool okay(double k)
{
int i,head=1,tail=0;
double MAX=-2000000000; s[0]=0;
for(i=1;i<=n;i++)s[i]=s[i-1]+(1.0*cost[i]-1.0*k*timp[i]);
for(i=l;i<=n;i++)
{
while(head<=tail&&ind[head]<i-u)head++;
while(head<=tail&&d[tail]>s[i-l])tail--;
tail++;
d[tail]=s[i-l];
ind[tail]=i-l;
MAX=max(MAX,s[i]-s[ind[head]]);
}
return (MAX>=0);
}
void solve()
{
double head,tail,mij,sol=0; int i;
f>>n>>l>>u;
for(i=1;i<=n;i++)f>>cost[i];
for(i=1;i<=n;i++)f>>timp[i];
head=0; tail=30000;
while(head<tail+0.00001)
{
mij=(head+tail)/2;
if(okay(mij)){if(sol<mij)sol=mij;head=mij+0.00001;} else tail=mij-0.00001;
}
g<<setprecision(2)<<fixed<<sol;
}
int main()
{
solve();
return 0;
}