Cod sursa(job #985226)

Utilizator danlexDan Alexandru danlex Data 16 august 2013 23:15:53
Problema Secventa 3 Scor 40
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.43 kb
#include <iostream>
#include <fstream>
#include <deque>
using namespace std;
#define MAX  500002
#define INF 1250000001

int u, l, n, t[MAX], c[MAX], dqsum = -INF;
deque<int> dq;
long long xsum = -INF, sumt[MAX], sumc[MAX];

void print(){
	cout << endl;
	cout << n << " " << l << " " << u << endl;
	for(int i = 1; i <= n; i ++){
		cout << c[i] << " ";
	}
	cout << endl;
	for(int i = 1; i <= n; i ++){
		cout << t[i] << " ";
	}
	cout << endl;
	cout << xsum/100 << ".";
	if(xsum%100 >= 10){
		cout << xsum % 100;
	} else {
		cout << "0" << xsum % 100;
	}
	cout << endl;
}

void read(){
	ifstream fi("secv3.in");
	fi >> n >> l >> u;
    for(int i = 1; i <= n; i++){
    	fi >> c[i];
	}
    for(int i = 1; i <= n; i++){
		fi >> t[i];
	}
	fi.close();
}

void write(){
    ofstream fo("secv3.out");
    fo << xsum / 100 << ".";
	if(xsum%100 >= 10){
        fo << xsum % 100;
    } else {
        fo << "0" << xsum % 100;
    }	
    fo.close();
}

void compute(){
	sumc[0] = 0;
	for(int i = 1; i <= n; i++){
        sumc[i] = sumc[i-1] + c[i];
    }

	sumt[0] = 0;
    for(int i = 1; i <= n; i++){
        sumt[i] = sumt[i-1] + t[i];
    }

	for(int i = 1; i <= n; i ++){
		for (int j = l; j <= u; j++){
			if (i >= j){
				dqsum = (sumc[i] - sumc[i - j]) * 100 / (sumt[i] - sumt[i - j]);
				//cout << i << " " << i - j << " " << dqsum << endl;
				if(dqsum > xsum) xsum = dqsum;
			}
		}
	}
}
int main(void){
    read();
    compute();
	//print();
	write();
    return 0;
}