题目大意:n棵树,计算彼此之间的最近距离,取最近距离的整数,依次输出最近距离为i(0<=i<=9)的树的个数。
解题过程:比较简单,一次AC
正确代码:
# include <cstdio>
# include <cstdlib>
# include <cstring>
# include <ctype.h>
# include <string>
# include <cmath>
//# define LOCAL
using namespace std;
int tree[5000][3];
int clodis[5000];
int cmp(const void*a,const void*b){
return (*(int*)a)-(*(int*)b);
}
int getdis(int* a,int* b){
int dis=(int)sqrt(pow(a[0]-b[0],2)+pow(a[1]-b[1],2)+pow(a[2]-b[2],2));
// printf("%d %d %d 和 %d %d %d 的距离是 %d\n",a[0],a[1],a[2],b[0],b[1],b[2],dis);
return dis;
}
int main(){
# ifdef LOCAL
freopen("in.txt","r",stdin);
freopen("out.txt","w",stdout);
#endif
int numoftree=0;
int field[10];
memset(field,0,sizeof(field));
while(1){
scanf("%d %d %d",&tree[numoftree][0],&tree[numoftree][1],&tree[numoftree][2]);
// printf("%d %d %d\n",tree[numoftree][0],tree[numoftree][1],tree[numoftree][2]);
if(tree[numoftree][0]==0&&tree[numoftree][1]==0&&tree[numoftree][2]==0) break;
numoftree++;
}
for(int i=0;i<numoftree;i++){
int * dis=new int[numoftree-1];
for(int j=0,k=0;j<numoftree;j++){
if(i==j) continue;
dis[k++]=getdis(tree[i],tree[j]);
}
qsort(dis,numoftree-1,sizeof(dis[0]),cmp);
clodis[i]=dis[0];
// printf("%d %d %d 的最近距离是 %d\n",tree[i][0],tree[i][1],tree[i][2],clodis[i]);
}
qsort(clodis,numoftree,sizeof(clodis[0]),cmp);
for(int i=0,j=0;i<numoftree;i++){
if(clodis[i]>j) j=clodis[i];
field[j]++;
}
for(int i=0;i<10;i++){
printf("%4d",field[i]);
}
printf("\n");
return 0;
}