Cod sursa(job #801550)

Utilizator wzrdwzrd tst wzrd Data 24 octombrie 2012 17:59:52
Problema Secventa 3 Scor 70
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.12 kb
#include <iostream>
#include <iomanip>
#include <fstream>
#include <algorithm>
#define DN 30005
using namespace std;

int n,l,u,st;
double v[DN],s[DN],t[DN],el[DN];

bool check(double r) {
    st=1;
    for(int i=1; i<=n; ++i) el[i]=s[i]-r*t[i];
    for(int i=1; i<=n; ++i) v[i]=v[i-1]+el[i];
    for(int i=l; i<=u; ++i) if(v[i]>=0) return 1;

    for(int i=u+1; i<=n; ++i) {
        for(;i-st>=u;++st);
        for(;i-st>l && v[i]-v[st]<0; ++st);
        if(v[i]-v[st]>=0) return 1;
    }
    st=1;
    reverse(el+1,el+n+1);
    for(int i=1; i<=n; ++i) v[i]=v[i-1]+el[i];

    for(int i=l; i<=u; ++i) if(v[i]>=0) return 1;

    for(int i=u+1; i<=n; ++i) {
        for(;i-st>=u;++st);
        for(;i-st>l && v[i]-v[st]<0; ++st);
        if(v[i]-v[st]>=0) return 1;
    }
    return 0;
}

int main()
{
    ifstream f("secv3.in");
    ofstream g("secv3.out");
    f>>n>>l>>u;
    for(int i=1; i<=n; ++i) f>>s[i];
    for(int i=1; i<=n; ++i) f>>t[i];
    double ls=0,ld=999999999,m;

    for(int i=1; i<=100; ++i) {
        m=(ls+ld)*0.5;
        if(check(m)) ls=m;
        else ld=m;
    }
    g<<fixed<<setprecision(12)<<ls;
    return 0;
}