Cost maxim

#include <iostream>
#include <fstream>
#define inf 10000
using namespace std;

ifstream fin("graf.in");
ofstream fout("graf.out");

int n,m,A[101][101],nr=0;

void Roy()
{
    for(int k=1;k<=n;k++)
        for(int i=1;i<=n;i++)
            for(int j=1;j<=n;j++)
                if(A[i][j]>A[i][k]+A[k][j])
                   {
                    cout<<"A["<<i<<","<<j<<"]="<<A[i][j]<<" ia valoarea "<<"A["<<i<<","<<k<<"]="<<A[i][k]<< " + "<<"A["<<k<<","<<j<<"]="<<A[k][j]<<"   ="  ;
                    A[i][j]=A[i][k]+A[k][j];
                    cout<<A[i][j]<<endl;
                    }

}

int main()
{
    int x,y,c;
    fin>>n>>m;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
            if(i!=j)
                A[i][j]=inf;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y>>c;
        A[x][y]=c;
    }
    Roy();
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
            if(A[i][j]>nr)
            nr=A[i][j];
    fout<<nr<<endl;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
            if(A[i][j]==nr)
                fout<<i<<" "<<j<<endl;
    return 0;
}