Pagini recente » Cod sursa (job #1675458) | Cod sursa (job #2940677) | Cod sursa (job #1217201) | Monitorul de evaluare | Cod sursa (job #1700640)
#include <fstream>
using namespace std;
int a[1001][1001],b[1001][1001],c[1001][1001],n,m,maxi,maxx=-9999999999,maxj;
ifstream fin("joc.in");
ofstream fout("joc.out");
int main()
{
fin>>n>>m;
for (int i=1;i<=n;i++)
for (int j=1;j<=m;j++)
{
fin>>a[i][j];
c[i][j]=a[i][j]-max(b[i-1][j],b[i][j-1]);
b[i][j]=max(c[i][j],max(b[i-1][j],b[i][j-1]));
if (c[i][j]>maxx)
{
maxx=c[i][j];
maxi=i;
maxj=j;
}
}
fout<<maxx<<' '<<maxi<<' '<<maxj;
return 0;
}