ypl.cpp

回溯法实现最小圆排列问题

#include "iostream.h"
#include "fstream.h"
#include "Circle.h"

void main(void)
{
	int n, i;
	double *r;
	ifstream fin("data.txt");
	fin>>n;
	r = new double [n+1];
	for(i = 1; i <= n; i++ )
	{
		fin>>r[i];
	}
	Circle CC(n, r);
	CC.Backtrack(1);
	CC.Print();
	delete [] r;
}