Cod sursa(job #18578)
Utilizator | Data | 18 februarie 2007 12:40:57 | |
---|---|---|---|
Problema | Plantatie | Scor | 30 |
Compilator | cpp | Status | done |
Runda | preONI 2007, Runda 2, Clasa a 10-a | Marime | 0.47 kb |
#include <fstream>
using namespace std;
ifstream fin("plantatie.in");
ofstream fout("plantatie.out");
long a[100][100], i, j, k, i1, ji, jj, t, maxi, n, m;
int main()
{
fin>>n>>m;
for(i=1; i<=n; i++)
for(j=1; j<=n; j++)
fin>>a[i][j];
for(t=1; t<=m; t++)
{
fin>>i>>j>>k;
i1=i+k;
ji=j;
jj=j+k;
maxi=0;
for( ; i<i1; i++)
for(j=ji; j<jj; j++)
if(a[i][j]>maxi)
maxi=a[i][j];
fout<<maxi<<"\n";
}
return 0;
}