Pagini recente » Cod sursa (job #3261401) | Cod sursa (job #603222) | Cod sursa (job #1089925) | Cod sursa (job #2222794) | Cod sursa (job #3230667)
#include <fstream>
#include <vector>
using namespace std;
ifstream f("plantatie.in");
ofstream g("plantatie.out");
int main()
{
int n, m, i, j, k, ki, kj, ii, jj, a[501][501], sef=0;
f>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
f>>a[i][j];
for(int p=1;p<=m;p++)
{
sef=0;
f>>i>>j>>k;
ki=k+i;
kj=k+j;
for(ii=i;ii<ki;ii++)
for(jj=j;jj<kj;jj++)
if(sef<a[ii][jj])
sef=a[ii][jj];
g<<sef<<"\n";
}
return 0;
}