Cod sursa(job #18240)
Utilizator | Filip Sanziana Zuzi | Data | 18 februarie 2007 10:59:41 |
---|---|---|---|
Problema | Plantatie | Scor | 60 |
Compilator | cpp | Status | done |
Runda | preONI 2007, Runda 2, Clasa a 10-a | Marime | 0.55 kb |
#include<stdio.h>
int n,m,a[500][500];
FILE *f=fopen("plantatie.in","r");
FILE *g=fopen("plantatie.out","w");
void read()
{ int i,j,cc,cl,d,e,l,c,k,max;
fscanf(f,"%d%d",&n,&m);
for (i=1;i<=n;i++)
for (j=1;j<=n;j++)
fscanf(f,"%d",&a[i][j]);
for (i=1;i<=m;i++)
{
fscanf(f,"%d%d%d",&l,&c,&k);
cl=l+k-1;
cc=c+k-1;
max=0;
for (d=l;d<=cl;d++)
for (e=c;e<=cc;e++)
if (a[d][e]>max)
max=a[d][e];
fprintf(g,"%d\n",max);
}
}
int main()
{
read();
fclose(f);
fclose(g);
return 0;
}