Cod sursa(job #18145)
Utilizator | Get a Life free2_do_rhymes | Data | 18 februarie 2007 10:08:23 |
---|---|---|---|
Problema | Plantatie | Scor | 10 |
Compilator | cpp | Status | done |
Runda | preONI 2007, Runda 2, Clasa a 10-a | Marime | 0.39 kb |
#include <fstream.h>
long int a[500][500],n,i,j,m,p,o,u,max=0,k;
int main()
{
ifstream f("plantatie.in");
ofstream g("plantatie.out");
f>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
f>>a[i][j];
for(i=1;i<=m;i++)
{
f>>p;
f>>o;
f>>u;
for(j=p;j<=u+p-1;j++)
for(k=p;k<=o+u-1;k++)
if(max<a[j][k])
max=a[j][k];
g<<max<<"\n";
max=0;
}
return 0;
}