Pagini recente » Cod sursa (job #103284) | Cod sursa (job #1864474) | Cod sursa (job #2545800) | Cod sursa (job #160479) | Cod sursa (job #2788538)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("plantatie.in");
ofstream fout("plantatie.out");
int a[501][501];
int r[75001];
int main() {
int n; int M;
fin >> n>>M;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
fin >> a[i][j];
}
}
for (int i = 1; i <= M; i++) {
int l, c, d;
fin >> l >> c >> d;
int maxi = 0;
for (int j = l; j <= l + d-1; j++) {
for (int k = c; k <= c + d-1; k++) {
if (a[j][k] >= maxi) {
maxi = a[j][k];
}
}
}
r[i] = maxi;
}
for (int i = 1; i <= M; i++) {
fout << r[i]<<'\n';
}
return 0;
}