Pagini recente » Cod sursa (job #35241) | Cod sursa (job #2549347) | Cod sursa (job #2647493) | Cod sursa (job #2059734) | Cod sursa (job #3133430)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
int main() {
ifstream f("plantatie.in");
int N, M;
f >> N >> M;
vector<vector<int>> productivity(N, vector<int>(N));
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
f >> productivity[i][j];
}
}
vector<vector<int>> queries(M, vector<int>(3));
for (int i = 0; i < M; i++) {
for (int j = 0; j < 3; j++) {
f >> queries[i][j];
}
}
ofstream g("plantatie.out");
for (int i = 0; i < M; i++) {
int max_productivity = 0;
int query_i = queries[i][0];
int query_j = queries[i][1];
int query_k = queries[i][2];
for (int row = query_i - 1; row < query_i - 1 + query_k; row++) {
for (int col = query_j - 1; col < query_j - 1 + query_k; col++) {
max_productivity = max(max_productivity, productivity[row][col]);
}
}
g << max_productivity << endl;
}
f.close();
g.close();
return 0;
}