Pagini recente » Cod sursa (job #1398287) | Cod sursa (job #73373) | Cod sursa (job #348587) | Cod sursa (job #805350) | Cod sursa (job #2937311)
#include<fstream>
#include<vector>
#include<algorithm>
//#include<iostream>
using namespace std;
class InParser {
vector<char> str;
int ptr;
ifstream fin;
char getChar() {
if (ptr == int(str.size())) {
fin.read(str.data(), str.size());
ptr = 0;
}
return str[ptr++];
}
template<class T>
T getInt() {
char chr = getChar();
while (!isdigit(chr) && chr != '-')
chr = getChar();
int sgn = +1;
if (chr == '-') {
sgn = -1;
chr = getChar();
}
T num = 0;
while (isdigit(chr)) {
num = num * 10 + chr - '0';
chr = getChar();
}
return sgn * num;
}
public:
InParser(const char* name) : str(1e5), ptr(str.size()), fin(name) { }
~InParser() { fin.close(); }
template<class T>
friend InParser& operator>>(InParser& in, T& num) {
num = in.getInt<T>();
return in;
}
};
class OutParser {
vector<char> str;
int ptr;
ofstream fout;
void putChar(char chr) {
if (ptr == int(str.size())) {
fout.write(str.data(), str.size());
ptr = 0;
}
str[ptr++] = chr;
}
template<class T>
void putInt(T num) {
if (num < 0) {
putChar('-');
num *= -1;
}
if (num > 9)
putInt(num / 10);
putChar(num % 10 + '0');
}
public:
OutParser(const char* name) : str(1e5), ptr(0), fout(name) { }
~OutParser() { fout.write(str.data(), ptr); fout.close(); }
template<class T>
friend OutParser& operator<<(OutParser& out, const T num) {
out.putInt(num);
return out;
}
friend OutParser& operator<<(OutParser& out, const char chr) {
out.putChar(chr);
return out;
}
friend OutParser& operator<<(OutParser& out, const char* str) {
for (int i = 0; str[i]; i++)
out.putChar(str[i]);
return out;
}
};
InParser cin("plantatie.in");
OutParser cout("plantatie.out");
int a[18][1000][1000],E[1000],lat,p,i,j;
int n,m;
int main()
{
cin>>n>>m;
for( i=1;i<=n;i++)
for(j=1;j<=n;j++ )
cin>>a[0][i][j];
for(p=1;(1<<p)<=n;p++)
{
for(i=1;i<=n-(1<<p)+1;i++)
for(j=1;j<=n-(1<<p)+1;j++)
{
int i2=i+(1<<(p-1));
int j2=j+(1<<(p-1));
a[p][i][j]=max(max(a[p-1][i][j],a[p-1][i2][j]),
max(a[p-1][i][j2],a[p-1][i2][j2]));
}
}
for(i=2;i<=n;i++)
E[i]=1+E[i/2];
int x,y,l;
for(;m;m--)
{
cin>>x>>y>>l;
int e=E[l];
int len=1<<e;
int i2=x+l-len;
int j2=y+l-len;
cout<<max(
max(a[e][x][y],a[e][i2][y]),
max(a[e][x][j2],a[e][i2][j2])
)<<'\n';
}
}