Cod sursa(job #587575)

Utilizator ProboteanuPaulProboteanu Paul ProboteanuPaul Data 5 mai 2011 10:46:49
Problema Arbore partial de cost minim Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.66 kb
#include<fstream>
using namespace std;
ifstream f("kr.in");
	ofstream g("kr.out");
int n,nr_muschii,k=1,T[3]50],H[50],M[3][50];

void citire()
{
	f>>n;
	while(f>>M[0][k]>>M[1][k]>>M[2][k])
		k++;
}
int arb(int nod)
{
	while(int nod)

			nod=T[nod];
		return nod;
	
}
int main()
{
	citire();
	k=1;
	do
	{
		while(arb(M[0][k])==arb(M[1][k]))
			k++;
		nr_muchii++;
		g<<M[0][k]<<" "<<M[1][k];
		g<<" "<<M[2][k]<<"\n";
		if(H[M[0][k]]==H[M[1][k]])
		{
			T[M[0][k]]=M[1][k];
			H[M[1][k]]++;
		}
		else
			if(H[M[0][k]]<H[M[1][k]])
				T[M[0][k]]=M[1][k];
			else
				T[M[1][k]]=M[0][k];
			k++;
	}
	while(nr_muchii<n-1);
	return 0;
}