恳请大佬查阅
  • 板块P5143 攀爬者
  • 楼主lv123123
  • 当前回复1
  • 已保存回复1
  • 发布时间2024/2/27 16:15
  • 上次更新2024/2/27 19:14:27
查看原帖
恳请大佬查阅
1260096
lv123123楼主2024/2/27 16:15
#include<stdio.h>
#include<math.h>
struct den{
	int x,y,z;
}den[50005];

int main()
{
	int n;
	scanf("%d", &n );
	for ( int i = 1; i <= n; i++ ) {
		scanf("%d %d %d", &den[i].x, &den[i].y, &den[i].z );
	}
	
	struct den t;
	for ( int i = 2; i <= n; i++ ) {
		for ( int j = i+1; j <= n; j++ )
		if ( den[i].z > den[j].z ) {
			t = den[i];
			den[i] = den[j];
			den[j] = t;
		}
	}
	
	double sum = 0;
	for ( int i = 2; i <= n; i++ ) {
		sum += sqrt( pow(den[i-1].x-den[i].x,2)+pow(den[i-1].y-den[i].y,2)+pow(den[i-1].z-den[i].z,2) );
	}
	printf("%.3lf", sum );
	return 0;
}
2024/2/27 16:15
加载中...