Cod sursa(job #3327089)

Utilizator Mirc100Mircea Octavian Mirc100 Data 2 decembrie 2025 10:50:56
Problema Algoritmul Bellman-Ford Scor 35
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.83 kb
#include<fstream>
#include<vector>
struct muchie{
int x,y, c;};
using namespace std;
vector<muchie> muchii;
int main(){
    int x,y,c;
    int n,m;
    ifstream f("bellmanford.in");
    ofstream g("bellmanford.out");
    f>>n>>m;
    vector<long> d(n+1,1e9);
    for(int i=0;i<m;i++){
        f>>x>>y>>c;
        muchii.push_back({x,y,c});
    }
    int s=1;
    d[s]=0;
    for(int k=0;k<n-1;k++)
        for(int i=0;i<m;i++){
            muchie m=muchii[i];
            if (d[m.x]+m.c<d[m.y])
                d[m.y]=d[m.x]+m.c;
        }
    int i;
    for(i=0;i<m;i++){
            muchie m=muchii[i];
            if (d[m.x]+m.c<d[m.y]){
                g<<"Ciclu negativ!";
                break;
            }
        }
    if(i==m){
        for(int i=2;i<=n;i++)
            g<<d[i]<<" ";
    }


}