pku2587.cpp

这是ACM 方面的资料 是PKU的 北京大学的出来的

#include <stdio.h>
#include <math.h>

typedef struct 
{
	double a, b;
	double x, y, z;
} Point;

Point p[1001];
double PI;

void calc(Point *p)
{
	double A, B;
	A = p->a * PI / 180;
	B = p->b * PI / 180;
	p->z = sin(A);
	p->x = cos(A) * sin(B);
	p->y = cos(A) * cos(B);
}

double Dis(int a, int b)
{
	return (p[a].x - p[b].x) * (p[a].x - p[b].x)
		+  (p[a].y - p[b].y) * (p[a].y - p[b].y)
		+  (p[a].z - p[b].z) * (p[a].z - p[b].z);
}

int main()
{
	double a, b;
	int K, i, minid, j;
	double min, max, tmp;
	PI = acos(-1);
	scanf("%d", &K);

	for (i = 0; i < K; i++)
	{
		scanf("%lf %lf", &p[i].a, &p[i].b);
		calc(p + i);
	}
	for (i = 0, min = 100, minid = 0; i < K; i++)
	{
		for (j = 0, max = 0; j < K; j++)
		{
			if (Dis(i, j) > max)
			{
				max = Dis(i, j);
			}
		}
		if (max < min)
		{
			minid = i;
			min = max;
		}
	}
	printf("%.2lf %.2lf\n", p[minid].a, p[minid].b);
	return 0;
}