Pagini recente » Cod sursa (job #291419) | Profil Popescovicescov | Cod sursa (job #372346) | Cod sursa (job #1180677) | Cod sursa (job #2304145)
#include <bits/stdc++.h>
using namespace std;
ifstream in("plantatie.in");
ofstream out("plantaite.out");
int v[505][505];
int n, m;
void citire()
{
in >> n >> m;
for(int i = 1; i <= n; i ++)
for(int j = 1; j <= n; j ++)
in >> v[i][j];
}
void solve()
{
while(m)
{
int a, b, c, mx = 0;
in >> a >> b >> c;
for(int i = a; i <= a + c - 1; i ++)
for(int j = b; j <= b + c - 1; j ++)
mx = max(mx, v[i][j]);
out << mx << '\n';
m --;
}
}
int main()
{
citire();
solve();
return 0;
}