当前位置：首页 -> 基础 -> c++编程基础

Getting in Line UVA 216(二)

2014-11-24 02:21:07 · 作者: · 浏览: 3
标签: Getting Line UVA 216
t (84,99) to (142,81) is 76.73 feet.
Number of feet of cable required is 274.40.
**********************************************************
Network #3
Cable requirement to connect (132,73) to (72,111) is 87.02 feet.
Cable requirement to connect (72,111) to (49,86) is 49.97 feet.
Number of feet of cable required is 136.99.
就是求最小生成树，可以回溯+搜索，因为n<=8所以可以暴力枚举，我在边界条件卡了很久。 
#include  
#include  
#include  
#include  
#include  
#include  
  
using namespace std;  
  
int num[10];  
int num1[10];  
int n;  
  
class P  
{  
public:  
    int x,y;  
}point[10];  
  
double dis()  
{  
    double sum=0;  
    for(int i=1;i>n&&n)  
    {  
        memset(point,0,sizeof(point));  
        memset(num,0,sizeof(num));  
        memset(num1,0,sizeof(num1));  
        int i;  
        for(i=0;i>point[i].x>>point[i].y;  
        for(i=0;i
因为第一个排列可能最优化，我忘记给他赋值了，找了好久的