Pagini recente » Cod sursa (job #2280712) | Cod sursa (job #2424988) | Cod sursa (job #710571) | Cod sursa (job #739515) | Cod sursa (job #476839)
Cod sursa(job #476839)
#include <cstdio>
int sol[1002][1002];
int main()
{
int n,m,i,j,max,x,a=1,b=1;
freopen("joc.in","r",stdin);
freopen("joc.out","w",stdout);
scanf("%d %d %d",&n,&m,&sol[1][1]);
max=sol[1][1];
for (j=2;j<=m;++j)
{
scanf("%d",&x);
sol[1][j]=x-sol[1][j-1];
if (sol[1][j]>max) max=sol[1][j],b=j;
if (sol[1][j]<sol[1][j-1]) sol[1][j]=sol[1][j-1];
}
for (i=2;i<=n;++i)
{
scanf("%d",&x);
sol[i][1]=x-sol[i-1][1];
if (sol[i][1]>max) max=sol[i][1],a=i,b=1;
if (sol[i][1]<sol[i-1][1]) sol[i][1]=sol[i-1][1];
for (j=2;j<=m;++j)
{
scanf("%d",&x);
sol[i][j]=x-sol[i-1][j];
if (sol[i][j-1]>sol[i-1][j]) sol[i][j]=x-sol[i][j-1];
if (sol[i][j]>max) max=sol[i][j],a=i,b=j;
if (sol[i][j]<sol[i-1][j]) sol[i][j]=sol[i-1][j];
if (sol[i][j]<sol[i][j-1]) sol[i][j]=sol[i][j-1];
}
}
printf("%d %d %d",max,a,b);
return 0;}