蛮力法最近对问题

最新推荐文章于 2023-02-28 15:59:26 发布

原创最新推荐文章于 2023-02-28 15:59:26 发布 · 1.3k 阅读

2 ·

CC 4.0 BY-SA版权

c++算法专栏收录该内容

5 篇文章

订阅专栏

//============================================================================
// Name        : 最近对问题.cpp
// Author      : 
// Version     :
// Copyright   : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================

#include <iostream>
using namespace std;
#define N 5

int  ClosePoints(int n,int x[],int y[])
{
	int index1=0;
	int index2=0;
	int minDist=1111111111;
	for(int i=1;i<n;i++)//点
	{
		for(int j=i+1;j<=n;j++)//其它的点
		{
			int d=(x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]);
			if(d<minDist)
			{
				minDist=d;
				 index1=i;
				 index2=j;
			}
		}
		cout<<"index1:"<<index1+1<<endl;
		cout<<"index2:"<<index2+1<<endl;
		cout<<"点一："<<"("<<x[index1]<<","<<y[index1]<<")"<<endl;
		cout<<"另一点："<<"("<<x[index2]<<","<<y[index2]<<")"<<endl;
		return minDist;
	}
	return 0;
}

int main()
{
	int x[N]={2,3,1,3,6};
	int y[N]={7,3,4,5,2};
	cout<<"最小的距离是的平方是："<<ClosePoints(N, x,y)<<endl;
	cout << "!!!Hello World!!!" << endl; // prints !!!Hello World!!!
	return 0;
}