Cod sursa(job #645337)

Utilizator d.andreiDiaconeasa Andrei d.andrei Data 9 decembrie 2011 11:59:01
Problema Algoritmul Bellman-Ford Scor 35
Compilator cpp Status done
Runda Arhiva educationala Marime 0.76 kb
#include <cstdio>


#define file_in "bellmanford.in"
#define file_out "bellmanford.out"

#define nmax 250100

int N,M,i;
int d[nmax];
int x[nmax];
int y[nmax];
int c[nmax];


int main(){
	
	freopen(file_in,"r",stdin);
	freopen(file_out,"w",stdout);
	
	scanf("%d %d", &N, &M);
	for (i=1;i<=M;++i){
		 scanf("%d %d %d", &x[i], &y[i], &c[i]);
		 if (x[i]==1)
			 d[y[i]]=c[i];
	}
	
	for (i=2;i<=N;++i)
		 if (d[i]==0)
			 d[i]=0x3f3f3f3f;
		 
	int ok=0;

	int nr=0;
	while(!ok){
		ok=1;
		for (i=1;i<=M;++i)
			 if (d[y[i]]>d[x[i]]+c[i])
				 d[y[i]]=d[x[i]]+c[i],
				 ok=0,
				 nr++;
		if (nr>nmax/20){
			printf("Ciclu negativ!\n");
			return 0;
			
		}
	}
	
	for (i=2;i<=N;++i)
		 printf("%d ", d[i]);
	
	return 0;
	
}