Cod sursa(job #941703)

Utilizator forgetHow Si Yu forget Data 19 aprilie 2013 15:15:19
Problema Algoritmul Bellman-Ford Scor 35
Compilator cpp Status done
Runda Arhiva educationala Marime 0.89 kb
#include <fstream>
#include <vector>
using namespace std;

int main()
{
	ifstream fin("bellmanford.in");
	ofstream fout("bellmanford.out");
	int n, m;
	fin >> n >> m;
	vector<pair<int,int> > adjl[n+1];
	vector<pair<int,int> >::iterator it;
	int u, v, w;
	for (; m > 0; --m) {
		fin >> u >> v >> w;
		adjl[u].push_back(pair<int,int>(v,w));
	}
	const int inf = 1e9;
	int dist[n+1];
	dist[1] = 0;
	for (int i = 2; i <= n; ++i)
		dist[i] = inf;
	for (int i = 1; i < n; ++i)
		for (int j = 1; j <= n; ++j)
			for (it = adjl[j].begin(); it != adjl[j].end(); ++it)
				dist[it->first] = min(dist[it->first],dist[j]+it->second);
	for (int i = 1; i < n; ++i)
		for (it = adjl[i].begin(); it != adjl[i].end(); ++it)
			if (dist[it->first] > dist[i]+it->second) {
				fout << "Ciclu negativ!";
				return 0;
			}
	for (int i = 2; i <= n; ++i)
		fout << dist[i] << ' ';
	return 0;
}