Cod sursa(job #24815)
Utilizator | Data | 3 martie 2007 17:28:08 | |
---|---|---|---|
Problema | Plantatie | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.48 kb |
#include <cstdio>
#define maxn 512
int x[maxn][maxn], n, m;
int main()
{
freopen("plantatie.in", "r", stdin);
freopen("plantatie.out", "w", stdout);
scanf("%d %d\n", &n, &m);
int i, j, t;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++) scanf("%d ", &x[i][j]);
for(i=1;i<=m;i++)
{
int a, b, k;
scanf("%d %d %d\n", &a, &b, &k);
int max=0;
for(j=a;j<a+k;j++)
for(t=b;t<b+k;t++)
if(x[j][t]>max) max=x[j][t];
printf("%d\n", max);
}
return 0;
}