Pagini recente » Cod sursa (job #2471697) | Cod sursa (job #1060421) | Cod sursa (job #1200726) | Cod sursa (job #1377497) | Cod sursa (job #1077366)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fi("plantatie.in");
ofstream fo("plantatie.out");
int a[502][75002],n,m,x,y,z;
int main()
{
fi>>n>>m;
for (int i=1;i<=n;i++)
for (int j=1;j<=n;j++)
fi>>a[i][j];
for (int i=1;i<=m;i++) {
fi>>x>>y>>z;
int mx=0;
for (int j=x;j<=x+z-1;j++)
for (int k=y;k<=y+z-1;k++)
if (a[j][k]>mx)
mx=a[j][k];
fo<<mx<<'\n';
}
return 0;
}