Pagini recente » Cod sursa (job #696199) | Cod sursa (job #646347) | Cod sursa (job #401572) | Cod sursa (job #2127701) | Cod sursa (job #50511)
Cod sursa(job #50511)
#include<fstream.h>
long long n;
long long m, a[600][600];
ifstream in("plantatie.in");
ofstream out("plantatie.out");
void citire()
{
in>>n>>m;
for (long long i=1; i<=n; i++)
for (long long j=1; j<=n; j++)
in>>a[i][j];
}
void max(long long i, long long j, long long k)
{
long long m=0;
for (long long l=i; l<=k+i-1; l++)
for (long long q=j; q<=k+j-1; q++)
if (a[l][q]>m) m=a[l][q];
out<<m<<'\n';
}
void calcul()
{
long long i, j, k;
for (long long x=1; x<=m; x++)
{
in>>i>>j>>k;
max(i,j,k);
}
}
int main()
{
citire();
calcul();
return 0;
}