【POJ】【P2420】【A Star not a Tree?】【题解】【模拟退火】

传送门：http://poj.org/problem?id=2420

题意:求费马点

模拟退火……WA的停不下来,原来poj的G++输出double必须用%f ,C++没问题……

P.S.似乎这道题参数随便选就能过?

Code:

#include<cmath>
#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
const double eps=1e-3;
const int maxn=105;
int n;
double a[maxn][2];
double dis(double x,double y,int i){
	return sqrt((x-a[i][0])*(x-a[i][0])+(y-a[i][1])*(y-a[i][1]));
}
double dist(double x,double y){
	double ans=0;
	for(int i=1;i<=n;i++)
	ans+=dis(x,y,i);
	return ans;
}
double rnd(){
	return (double)rand()/RAND_MAX;
}
int main(){
	srand(10086);
	while(scanf("%d",&n)==1){
		double x=0,y=0;
		for(int i=1;i<=n;i++)
		scanf("%lf%lf",&a[i][0],&a[i][1]),
		x+=a[i][0],y+=a[i][1];
		x/=n;y/=n;
		double T=1e5,ans=dist(x,y);
		while(T>0.02){
			double dx=0,dy=0;
			for(int i=1;i<=n;i++){
				dx+=(a[i][0]-x)/dis(x,y,i);
				dy+=(a[i][1]-y)/dis(x,y,i);
			}
			double res=dist(x+dx*T,y+dy*T);
			if(res<ans){
				ans=res;x+=dx*T;y+=dy*T;
			}else{
				if(rnd()<pow(2.718281828,(res-ans)/T)){
					ans=res;x+=dx*T;y+=dy*T;
				}
			}
			T*=0.9;
		}printf("%.0f\n",ans);
	}
	return 0;
}