Cod sursa(job #1436070)

Utilizator vlad.olaruOlaru Andrei Vlad vlad.olaru Data 14 mai 2015 23:43:24
Problema Arbore partial de cost minim Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.79 kb
#include <iostream>
#include<fstream>
using namespace std;
const int infinit=1.e20;

int n,s[50],i,j,k,c,lin,col;
float mini,C[50][50];
	
ofstream g("apm.out");

void citesc()
{
    ifstream f("apm.in");
    f>>n;
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
          if(i==j) C[i][j]=0;
    else
        C[i][j]=C[j][i]=infinit;
        while(f>>i>>j>>c)
            C[i][j]=C[j][i]=c;
        f.close();
}



int main()
{
    citesc();
    s[1]=1;
    for(k=1;k<=n-1;k++)
    {
        mini=infinit;
        for(i=1;i<=n;i++)
            for(j=1;j<=n;j++)
            if(s[i]==1 && s[j]==0 && mini>C[i][j])
        {
            mini=C[i][j];
            lin=i;col=j;
        }
        g<<lin<<" "<<col<<" "<<mini<<endl;
        s[col]=1;
    }
    return 0;
}