Cod sursa(job #2304145)
| Utilizator | Data | 17 decembrie 2018 16:54:05 | |
|---|---|---|---|
| Problema | Plantatie | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.62 kb |
#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;
}
