【ZOJ Problem Set - 1067】Color Me Less

Problem：http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=67

---

Code:

#include<iostream>
#include<cmath>
using namespace std;
int main()
{
	 int i = 0, j = 0, count=0, near=0;     //count统计输入的数组个数  near返回最近点下标
	 int T[256][3];          //使用二维数组保存输入数据
	 float D[256];           //保存点之间的距离
	 for (i = 0; i < 256; i++)                         //输入
	 {
	  for (j = 0; j < 3; j++) 
	  {
		 cin >> T[i][j];
   
  		 if (T[i][0] == -1 && T[i][1] == -1 && T[i][2] == -1) break;
	  }
	  count++;
	  if (T[i][0] == -1 && T[i][1] == -1 && T[i][2] == -1) break;
	 }
	 cout << endl;
	 for (i = 16; i < count - 1; i++)                //输出
 	 {
 		for (j = 0; j < 16; j++)
		{
  			D[j] = sqrt((T[i][0] - T[j][0])*(T[i][0] - T[j][0]) + (T[i][1] - T[j][1])*(T[i][1] - T[j][1]) + (T[i][2] - T[j][2])*(T[i][2] - T[j][2]));
  		}
  		for (j = 1; j < 16; j++)
  		{
   			if (D[j] < D[near]) 
   				 near=j;
  		}
  		cout << "(" << T[i][0] << "," << T[i][1] << "," << T[i][2] << ")" << " maps to " << "(" << T[near][0] << "," << T[near][1] << "," << T[near][2] << ")" << endl;
  	}
  	return 0;
  }

---

输入可直接复制如下:

0 0 0
255 255 255
0 0 1
1 1 1
128 0 0
0 128 0
128 128 0
0 0 128
126 168 9
35 86 34
133 41 193
128 0 128
0 128 128
128 128 128
255 0 0
0 1 0
0 0 0
255 255 255
253 254 255
77 79 134
81 218 0
-1 -1 -1

---