这个不是这道题目的代码
by Kiel @ 2018-07-24 11:29:36
```cpp
#include<iostream>
#include<cmath>
#include<cstring>
using namespace std;
double s,n,l,m,x,y,z,a[7],b[7],f[7][7],r[7],r1[6],ans=0.0;
bool used[7];
const double PI=3.1415926535;
double js(int j){
double ss=r1[j];
for(int i=1;i<=n;i++){
if(used[i]&&i!=j){
ss=min(ss,max(f[i][j]-r[i],0.0));
}
}
return ss;
}
void dfs(int k,double now){
if(k>n){
ans=max(ans,now);
return ;
}
for(int i=1;i<=n;i++){
if(!used[i]){
r[i]=js(i);
used[i]=1;
dfs(k+1,now+r[i]*r[i]*PI);
used[i]=0;
}
}
}
int main(){
cin>>n;
cin>>x>>y>>z>>l;
double s=abs(x-z)*abs(y-l);
for(int i=1;i<=n;i++){
cin>>a[i]>>b[i];
r1[i]=min(min(abs(x-a[i]),abs(a[i]-z)),min(abs(y-b[i]),abs(l-b[i])));
}
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(f[i][j]==0&&i!=j){
f[i][j]=sqrt((a[i]-a[j])*(a[i]-a[j])+(b[i]-b[j])*(b[i]-b[j]));
f[j][i]=f[i][j];
}
}
}
dfs(1,0);
cout<<int(((s-ans)*10+5)/10);
return 0;
}
```
这是修改过后的代码，过了
by Kiel @ 2018-07-24 11:34:29
只要把精度修改就行
by Kiel @ 2018-07-24 11:34:49
@[wangjiachi](/space/show?uid=67418)
by Kiel @ 2018-07-24 11:34:53
@[something](/space/show?uid=84025)
自己@自己还行
by wangjiachi @ 2018-07-24 14:29:28
@[wangjiachi](/space/show?uid=67418) emmm
by Kiel @ 2018-07-24 21:52:50
@[something](/space/show?uid=84025)
第7个还是负的（手动苦笑
加个qq吧同学！
by wangjiachi @ 2018-07-25 14:06:07
3158703031 我的
by Kiel @ 2018-07-25 14:07:21
@[wangjiachi](/space/show?uid=67418)
by Kiel @ 2018-07-25 14:07:53
@[something](/space/show?uid=84025)
发送邀请了
by wangjiachi @ 2018-07-25 14:10:59