Pagini recente » Cod sursa (job #1802390) | Cod sursa (job #2322778) | Cod sursa (job #1739711) | Cod sursa (job #1617224) | Cod sursa (job #2924713)
#include <cmath>
#define notlocal 1
#if !notlocal
#include <iostream>
#define fin std::cin
#define fout std::cout
#else
#include <fstream>
std::ifstream fin("plantatie.in");
std::ofstream fout("plantatie.out");
#endif
using namespace std;
const int NMAX = 500;
int v[NMAX + 5][NMAX + 5];
int rmq[NMAX + 5][NMAX + 5][9];
int main()
{
int n, m;
fin >> n >> m;
for (int i = 0; i < n; ++i)
{
for (int j = 0; j < n; ++j)
{
fin >> v[i][j];
std::cout << v[i][j] << ' ' << i << ' ' << j << '\n';
rmq[i][j][0] = v[i][j];
}
}
for (int i = n - 1; i > -1; --i)
{
for (int j = n - 1; j > -1; --j)
{
for (int l = 1; max(i, j) + (1 << l) < n + 1; ++l)
{
rmq[i][j][l] = max(max(max(rmq[i][j][l - 1], rmq[i + (1 << (l - 1))][j][l - 1]), rmq[i][j + (1 << (l - 1))][l - 1]), rmq[i + (1 << (l - 1))][j + (1 << (l - 1))][l - 1]);
}
}
}
int x, y, z, l;
for (int i = 0; i < m; ++i)
{
fin >> x >> y >> z;
x--;
y--;
l = log2(z);
fout << max(rmq[x][y][l], max(rmq[x + z - (1 << l)][y][l], max(rmq[x][y + z - (1 << l)][l], rmq[x + z - (1 << l)][y + z - (1 << l)][l]))) << '\n';
}
return 0;
}