文章
119
粉丝
68
获赞
92
访问
20.1k
#include <bits/stdc++.h>
using namespace std;
struct plant{
int id;
double x,y,z;
plant(int id,double x,double y,double z):id(id),x(x),y(y),z(z){}
};
struct coreDISTANCE{
int id;
double distance;
coreDISTANCE(int id,double distance):id(id),distance(distance){}
bool operator<(coreDISTANCE b){
if(distance==b.distance)return id<b.id;
else return distance<b.distance;
}
};
int main() {
int n;
while(cin>>n){
vector<plant> a;
for(int i=0;i<n;i++){
double x,y,z;cin>>x>>y>>z;
a.push_back(plant(i,x,y,z));
}
double x1,y1,z1,x2,y2,z2;cin>>x1>>y1>>z1>>x2>>y2>>z2;
x1=(x1+x2)/2.0;y1=(y1+y2)/2.0;z1=(z1+z2)/2.0;
vector<coreDISTANCE>b;
for(int i=0;i<n;i++){
b.push_back(coreDISTANCE(i,pow(a[i].x-x1,2)+pow(a[i].y-y1,2)+pow(a[i].z-...
登录后发布评论
暂无评论,来抢沙发