Pagini recente » Cod sursa (job #3154841) | Cod sursa (job #2711267) | Cod sursa (job #2927618) | Cod sursa (job #1534379) | Cod sursa (job #921868)
Cod sursa(job #921868)
#include<fstream>
using namespace std;
ifstream fin("plantatie.in");
ofstream fout("plantatie.out");
int maxx = -9999;
int N, M, A[500][500], c, t, p;
void Read()
{
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++)
{
maxx = -9999;
fin >> c >> t >> p;
for(int j = c; j <= p; j++)
for(int h = t; h <= p; h++)
if(A[j][h] > maxx)
maxx = A[j][h];
fout << maxx << '\n';
}
}
int main()
{
Read();
fin.close();
fout.close();
return 0;
}