Pagini recente » Banana | Istoria paginii utilizator/paralax | Diferente pentru articole intre reviziile 75 si 192 | Istoria paginii utilizator/cosmin996 | Cod sursa (job #2829843)
#include<bits/stdc++.h>
#define db double
#define prec 0.01
using namespace std;
ifstream fin("secv3.in");
ofstream fout("secv3.out");
int const N = 30001;
deque<pair<int , int>> d;
int n , l , u;
int c[N] , t[N];
bool ok(db x){
vector<db> v(n + 1) , sp(n + 1);
for(int i = 1 ; i <= n ; ++ i)
v[i] = (db)c[i] - x * t[i];
for(int i = 1 ; i <= n ; ++ i)
sp[i] = sp[i - 1] + v[i];
deque<int> d;
for(int i = l ; i <= n ; ++ i){
while(!d.empty() && sp[i - l] <= sp[d.back()])
d.pop_back();
d.push_back(i - l);
if(d.front() == i - u - 1)
d.pop_back();
if(sp[i] >= sp[d.front()])
return true;
}
return false;
}
int main()
{
fin >> n >> l >> u;
for(int i = 1 ; i <= n ; ++ i)
fin >> c[i];
for(int i = 1 ; i <= n ; ++ i)
fin >> t[i];
db st = 0.001 , dr = 1000.0 , ans;
while(dr - st > prec){
db mid = (st + dr) / 2;
if(ok(mid)){
ans = mid;
st = mid + prec;
}
else
dr = mid - prec;
}
fout << fixed << setprecision(2) << ans << '\n';
return 0;
}