Pagini recente » Cod sursa (job #3185966) | Cod sursa (job #1838235) | Cod sursa (job #248827) | Cod sursa (job #1343384) | Cod sursa (job #773248)
Cod sursa(job #773248)
#include <fstream>
using namespace std;
int N, L, U, a;
double C[30005];
double T[30005];
double more = 0;
void Citire () {
ifstream fin ("secv3.in");
fin >> N >> L >> U;
for (int i = 0; i < N; i++)
fin >> C[i];
for (int i = 0; i < N; i++)
fin >> T[i];
fin.close ();
}
int Good (double K) {
int a = -1;
double S1 = 0, S2 = 0;
for (int i = 0; i < N; i++)
{
S1 += C[i];
S2 += T[i];
if (i - a >= U) S1 -= C[a], S2 -= T[a++];
while (a < i && S1 / S2 - K < 0)
{
S1 -= C[a + 1];
S2 -= T[a + 1];
a++;
}
if (i - a >= L) return 1;
}
return 0;
}
double B_Search () {
double i = 0, step = 1024;
for (; step >= 0.0001; step /= 2)
if (Good (i + step)) i += step;
return i;
}
void Scriere () {
ofstream fout ("secv3.out");
fout << B_Search ();
fout.close ();
}
int main () {
Citire ();
Scriere ();
return 0;
}