Pagini recente » Cod sursa (job #2261332) | Cod sursa (job #2487753) | Cod sursa (job #935226) | Cod sursa (job #2054669) | Cod sursa (job #19397)
Cod sursa(job #19397)
#include <fstream>
#include <iostream>
using namespace std;
const int MAX_N = 512;
int N, M;
int A[MAX_N][MAX_N];
int main(void) {
fstream in("plantatie.in", ios::in);
fstream out("plantatie.out", ios::out);
in >> N >> M;
int i, j;
for (i = 0; i < N; ++ i) {
for (j = 0; j < N; ++ j) {
in >> A[i][j];
}
}
int t, nc, is, js;
for (t = 0; t < M; ++ t) {
int max = 0;
in >> is >> js >> nc;
is --;
js --;
for (i = is; i < is + nc; ++ i) {
for (j = js; j < js + nc; ++ j) {
if (max < A[i][j]) {
max = A[i][j];
}
}
}
out << max << "\n";
}
return 0;
}