Cod sursa(job #1209499)

Utilizator socratescaesarsocrates caesar socratescaesar Data 17 iulie 2014 21:13:06
Problema Secventa 3 Scor 0
Compilator c Status done
Runda Arhiva de probleme Marime 1.08 kb
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("secv.in");
ofstream g("secv.out");
int c[100],t[100],N,L,U,i,r[10][10],s1[10][10],s2[10][10],maxi,j,k;
void citire()
{f>>N>>L>>U;
for(i=1;i<=N;i++)
    f>>c[i];
for(i=1;i<=N;i++)
    f>>t[i];
}
void suma()
{s1[L][1]=0;
s2[L][1]=0;
for(k=L;k<=U;k++)
    for(j=1;j<=N-k+1;j++)
        for(i=j;i<=j+k-1;i++)
            {s1[k][j]=s1[k][j]+c[i];
            s2[k][j]=s2[k][j]+t[i];
            }
}
void raport()
{for(k=L;k<=U;k++)
    for(j=1;j<=N-k+1;j++)
        r[k][j]=s1[k][j]/s2[k][j];
}
void maxim()
{maxi=r[L][1];
for(k=L;k<=U;k++)
    for(j=1;j<=N-k+1;j++)
        if(maxi<r[k][j])
            maxi=r[k][j];
}
int main()
{citire();
suma();
for(k=L;k<=U;k++)
    {g<<endl;
    for(j=1;j<=N-L+1;j++)
        g<<s1[k][j]<<" ";}
    g<<endl;
for(k=L;k<=U;k++)
    {g<<endl;
    for(j=1;j<=N-L+1;j++)
        g<<s2[k][j]<<" ";}
    g<<endl;
raport();
for(k=L;k<=U;k++)
    {g<<endl;
    for(j=1;j<=N-L+1;j++)
        g<<r[k][j]<<" ";}
    g<<endl;
maxim();
g<<maxi;
return 0;
}