题目大意:到所有顶点距离和最小的点
有正确的解法,但也没有必要,而且时间限制为3s。
我们考虑模拟退火算法即可。甚至当 d i s ( x ′ ) ≤ d i s ( x ) dis(x')\leq dis(x) dis(x′)≤dis(x)时可以直接跳过(爬山法),参数也不用调太久。
这样就良心了?不
每次输出得多一个换行…,恶心
#include<cstdio>
#include<iostream>
#include<cmath>
using namespace std;
const double T0=1e7,T1=1e-4,k=0.9;
const int L=100;
int n;
struct qh{double x,y;}a[105];
double sqr(double x){return x*x;}
double f(double x,double y){
double dis=0;
for(int i=1;i<=n;i++) dis+=sqrt(sqr(x-a[i].x)+sqr(y-a[i].y));
return dis;
}
double Rand(double x){return 1.0*rand()/RAND_MAX*x;}
int main(){
int T;scanf("%d",&T);
while (T--){
scanf("%d",&n);
for(int i=1;i<=n;i++) scanf("%lf%lf",&a[i].x,&a[i].y);
double t=T0,x=0,y=0;
while (t>T1){
for(int i=1;i<=L;i++){
double xx=-1;
while (xx<-0.01||xx>10000.01) xx=x+(Rand(20000)-10000.0)*5.0*(t/T0);
double yy=-1;
while (yy<-0.01||yy>10000.01) yy=y+(Rand(20000)-10000.0)*5.0*(t/T0);
if(f(xx,yy)<f(x,y)) x=xx,y=yy;
}
t*=k;
}
printf("%.0f\n",f(x,y));
if(T) printf("\n");
}
return 0;
}
/*
start coding:16:46
finish debuging:17:00
*/