Pagini recente » Cod sursa (job #2455311) | Cod sursa (job #579575) | Cod sursa (job #2637771) | Cod sursa (job #2641044) | Cod sursa (job #1326955)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("plantatie.in");
ofstream fout("plantatie.out");
int N,M,P[501][501][501];
void citire()
{
int i,j;
fin>>N>>M;
for(i=1;i<=N;i++)
for(j=1;j<=N;j++)
fin>>P[i][j][1];
}
int main()
{
citire();
int i,k,j,x,y,l;
for(k=2;k<=N;k++)
for(i=1;i<=N;i++)
for(j=1;j<=N;j++)
P[i][j][k]=max(P[i][j][k-1],max(P[i+1][j+1][k-1],max(P[i][j-1][k-1],P[i-1][j][k-1])));
for(i=1;i<=M;i++)
{
fin>>x>>y>>l;
fout<<P[x][y][l]<<" \n";
}
return 0;
}