Pagini recente » Cod sursa (job #2453550) | Cod sursa (job #904773) | Cod sursa (job #1514055) | Borderou de evaluare (job #1036778) | Cod sursa (job #1501494)
#include <fstream>
#include <cstring>
#include <climits>
#define MAX_N 50001
#define MAX_M 250001
#define INF 1061109567
using namespace std;
int m,n,s,e[MAX_M][3],d[MAX_N];
void rez(int s)
{
int ok,nr,i,j,c,k;
memset(d,INF,sizeof(d));
d[s]=0;
for(ok=nr=1;ok&&nr<n;nr++)
for(ok=k=0;k<m;k++)
{
i=e[k][0];
j=e[k][1];
c=e[k][2];
if(d[j]>d[i]+c)
{
d[j]=d[i]+c;
ok=1;
}
}
}
int main()
{
ifstream f("dijkstra.in");
f>>n>>m;
for(int i=0;i<m;i++)
f>>e[i][0]>>e[i][1]>>e[i][2];
f.close();
rez(1);
ofstream g("dijkstra.out");
for(int i=2;i<=n;i++)
if(d[i]!=INF)g<<d[i]<<" ";
else g<<"0 ";
g.close();
return 0;
}