Pagini recente » Cod sursa (job #3799) | Cod sursa (job #18197)
Cod sursa(job #18197)
#include <fstream.h>
int main ()
{
int n,p[50][50],m,nri[50],nrj[50],nrk[50];
int i,j,contor1,contor2,max;
std::ifstream f ("plantatie.in")
f>>n>>m;
for (i=0;i<n;i++)
for (j=0;j<n;j++)
f>>p[i][j];
for (i=0;i<m;i++)
f>>nri[i]>>nrj[i]>>nrk[i];
f.close();
for (i=0;i<m;i++)
{
nri[i]--;
nrj[i]--;
}
std::ofstream g ("plantatie.out")
for (i=0;i<m;i++)
{
max=0;
for (contor1=nri[i];contor1<nri[i]+nrk[i];contor1++)
for (contor2=nrj[i];contor2<nrj[i]+nrk[i];contor2++)
if (p[contor1][contor2]>max)
max=p[contor1][contor2];
g<<max<<'\n';
}
g.close();
return 0;
}