#include?
#include?
using?namespace?std;

int?main（）
{
???????int?point[10][3]={{000}{535}{754}{545}{386}{487}{646}{113}{634}{224}};
???????int?z[10][3]={0};
	???
???????z[0][0]=point[0][0];
	???z[0][1]=point[0][1];
	???z[0][2]=point[0][2];
		//依次算出與第一個點z的距離，找出最大距離點，確定第二個z
	???double?temp_distance=0.0;
	???int?count=0;//記錄z所在點的序列
	???int?z_num=0;
???????for（int?item=0;item<10;item++）
???????{
			double?distance=sqrt（（point[item][0]-z[0][0]）*（point[item][0]-z[0][0]）+（point[item][1]-z[0][1]）*（point[item][1]-z[0][1]）+（point[item][2]-z[0][2]）*（point[item][2]-z[0][2]））;
		???if（distance>temp_distance）
???????????{
				??temp_distance=distance;
??????????????????count=item;
???????????}
???????}
	???z_num++;
		//確定記錄第二個z
???????z[1][0]=point[count][0];
	???z[1][1]=point[count][1];
	???z[1][2]=point[count][2];
		z_num++;
???????
		//計算閾值q
	???double?q=0.5*sqrt（（z[1][0]-z[0][0]）*（z[1][0]-z[0][0]）+（z[1][1]-z[0][1]）*（z[1][1]-z[0][1]）+（z[1][2]-z[0][2]）*（z[1][2]-z[0][2]））;

	???double?w_distance[10];
???????do
???????{
????????//以下為聚類中心到每一個樣本的最小距離
		???for（int?i=0;i<10;i++）
		???{
			???double?min_distance=sqrt（（point[i][0]-z[0][0]）*（point[i][0]-z[0][0]）+（point[i][1]-z[0][1]）*（point[i][1]-z[0][1]）+（point[i][2]-z[0][2]）*（point[i][2]-z[0][2]））;
			???for（int?j=1;j<=z_num;j++）
???????????????{
				???double?distance=sqrt（（point[i][0]-z[j][0]）*（point[i][0]-z[j][0]）+（point[i][1]-z[j][1]）*（point[i][1]-z[j][1]）+（point[i][2]-z[j][2]）*（point[i][2]-z[j][2]））;
				???if（distance					???min_distance=distance;
???????????????}
			???w_distance[i]=min_distance;
		???}
		???//以下為取這些最小距離中的最大值
		???temp_distance=w_distance[0];
		???for（int?temp=1;temp<10;temp++）
		???{
			???if（w_distance[temp]>temp_distance）
			???{
				???temp_distance=w_distance[temp];
				???count=temp;
			???}
		???}
		???if（temp_distance>q）
		???{
				z[z_num][0]=point[count][0];??//最大值對應的樣本作為聚類中心
				z[z_num][1]=point[count][1];
				z[z_num][2]=point[count][2];
				z_num++;
		???}
		???else?break;
	???}while（true）;

???????//以下為輸出所分得的類別
???????cout<<“由最大最小算法進行歸類\n“;
	???for（item=0;item		???cout<<“（“<
???????//以下為最近距離算法
???????cout<<“歸完類后由最近距離得最后結果\n“;
	???for（int?i=0;i<10;i++）
???????{???
		???int?k=0;
		???double?min_distance=sqrt（（point[i][0]-z[0][0]）*（point[i][0]-z[0][0]）+（point[i][1]-z[0][1]）*（point[i][1]-z[0][1]）+（point[i][2]-z[0][2]）*（point[i][2]-z[0][2]））;
???????????for（int?j=0;j???????????{
			???double?distance=sqrt（（point[i][0]-z[j][0]）*（point[i][0]-z[j][0]）+（point[i][1]-z[j][1]）*（point[i][1]-z[j][1]）+（point[i][2]-z[j][2]）*（point[i][2]-z[j][2]））;
			???if（distance			???{
				???min_distance=distance;
				???count=i;
				???k=j;
			???}
		???}
		???cout<<“（“<	

?屬性????????????大小?????日期????時間???名稱
-----------?---------??----------?-----??----
?????目錄???????????0??2018-08-31?19:31??MaxMinDis1\
?????目錄???????????0??2018-08-31?19:28??MaxMinDis1\MaxMinDis\
?????目錄???????????0??2018-08-31?19:27??MaxMinDis1\MaxMinDis\Debug\
?????文件??????524348??2012-05-04?22:29??MaxMinDis1\MaxMinDis\Debug\MaxMinDis.exe
?????文件??????778116??2012-05-04?22:29??MaxMinDis1\MaxMinDis\Debug\MaxMinDis.ilk
?????文件??????151673??2012-05-04?22:29??MaxMinDis1\MaxMinDis\Debug\MaxMinDis.obj
?????文件?????2009712??2012-04-26?12:13??MaxMinDis1\MaxMinDis\Debug\MaxMinDis.pch
?????文件?????1074176??2012-05-04?22:29??MaxMinDis1\MaxMinDis\Debug\MaxMinDis.pdb
?????文件???????74752??2018-08-31?19:28??MaxMinDis1\MaxMinDis\Debug\vc60.idb
?????文件??????110592??2012-05-04?22:29??MaxMinDis1\MaxMinDis\Debug\vc60.pdb
?????文件????????3167??2012-05-04?22:29??MaxMinDis1\MaxMinDis\MaxMinDis.cpp
?????文件????????3437??2018-08-31?19:27??MaxMinDis1\MaxMinDis\MaxMinDis.dsp
?????文件?????????524??2018-08-31?19:28??MaxMinDis1\MaxMinDis\MaxMinDis.dsw
?????文件???????50176??2018-08-31?19:28??MaxMinDis1\MaxMinDis\MaxMinDis.ncb
?????文件???????48640??2018-08-31?19:28??MaxMinDis1\MaxMinDis\MaxMinDis.opt
?????文件?????????252??2018-08-31?19:27??MaxMinDis1\MaxMinDis\MaxMinDis.plg
?????文件???????15737??2018-08-31?15:06??MaxMinDis1\Microsoft?Office?Word?文檔.docx