Cod sursa(job #18573)
| Utilizator | Data | 18 februarie 2007 12:39:27 | |
|---|---|---|---|
| Problema | Plantatie | Scor | 60 |
| Compilator | cpp | Status | done |
| Runda | preONI 2007, Runda 2, Clasa a 10-a | Marime | 0.51 kb |
#include <stdio.h>
#define nmax 501
long a[nmax][nmax];
FILE *f,*g;
int main()
{
long n,m,i,j,l,p,q,k,max;
f=fopen("plantatie.in","rt");
g=fopen("plantatie.out","wt");
fscanf(f,"%ld %ld",&n,&m);
for (i=1;i<=n;i++)
for (j=1;j<=n;j++)
fscanf(f,"%ld",&a[i][j]);
for (i=1;i<=m;i++)
{
fscanf(f,"%ld %ld %ld",&p,&q,&k);
max=0;
for (j=p;j<p+k;j++)
for (l=q;l<q+k;l++)
if (a[j][l]>max)
max=a[j][l];
fprintf(g,"%ld\n",max);
}
fclose(f);
fclose(g);
return 0;
}
