Pagini recente » Cod sursa (job #3347085) | Cod sursa (job #3341272) | Cod sursa (job #3338233) | Cod sursa (job #2866680) | Cod sursa (job #3316944)
#include <bits/stdc++.h>
#define cin fin
#define cout fout
using namespace std;
ifstream fin("secv3.in");
ofstream fout("secv3.out");
int scost[30001], stimp[30001];
int n, l, u, c, t;
bool ordine(double x, int i, int j){
return scost[i] - x * stimp[i] < scost[j] - stimp[j] * x;
}
bool verif(double x){
deque<int> dq;
for(int i = 1; i <= n; i ++){
if(i > u){
if(!dq.empty() && dq.front() < i - u){
dq.pop_front();
}
}
if(i > l){
while(!dq.empty() && ordine(x, i - l, dq.back())){
dq.pop_back();
}
dq.push_back(i - l);
}
if(!dq.empty() && !ordine(x, i, dq.front())){
return 1;
}
}
return 0;
}
int main()
{
cin >> n >> l >> u;
for(int i = 1; i <= n; i ++){
cin >> c;
scost[i] = scost[i - 1] + c;
}
for(int i = 1; i <= n; i ++){
cin >> t;
stimp[i] = stimp[i - 1] + t;
}
double st = 0, dr = 1000, x, sol;
for(int i = 1; i <= 100; i ++){
x = (st + dr) / 2;
if(verif(x)){
st = x;
sol = x;
}
else{
dr = x;
}
}
cout << fixed << setprecision(2) << x;
}