Cod sursa(job #18225)
Utilizator | Data | 18 februarie 2007 10:49:40 | |
---|---|---|---|
Problema | Plantatie | Scor | 0 |
Compilator | cpp | Status | done |
Runda | preONI 2007, Runda 2, Clasa a 10-a | Marime | 0.43 kb |
#include<fstream.h>
int n,m,l,c,nr,a[501][501],max,i,j,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>>l>>c>>nr;
max=0;
for(j=1;j<l+nr;j++)
for(k=1;k<c+nr;k++)
if(a[j][k]>max)
max=a[j][k];
g<<max<<'\n';
}
return 0;
}