Cod sursa(job #1915913)
| Utilizator | Data | 8 martie 2017 23:05:33 | |
|---|---|---|---|
| Problema | Algoritmul lui Dijkstra | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;int n,m,d[50050];struct my{int x,y,l;}V[250100];bool u=1;int main(){ifstream f("dijkstra.in");ofstream c("dijkstra.out");f>>n>>m;for(int i=1;i<=m;i++)f>>V[i].x>>V[i].y>>V[i].l;for(int i=2;i<=n;i++)d[i]=1e9;while(u){u=0;for(int i=1;i<=m;i++)if(d[V[i].y]>d[V[i].x]+V[i].l)d[V[i].y]=d[V[i].x]+V[i].l,u=1;}for(int i=2;i<=n;i++)c<<(d[i]<1e9?d[i]:0)<<" ";}
