http://acm.hdu.edu.cn/showproblem.php?pid=4717
三分答案,求一个区间内的极值。
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
typedef long long ll;
const double eps=1e-6;
const int maxn=310;
struct node{
double x,y,vx,vy;
}num[maxn];
int n;
double dis(int i,int j,double t){
double ans=(num[i].x+num[i].vx*t-num[j].x-num[j].vx*t)*(num[i].x+num[i].vx*t-num[j].x-num[j].vx*t)+(num[i].y+num[i].vy*t-num[j].y-num[j].vy*t)*(num[i].y+num[i].vy*t-num[j].y-num[j].vy*t);
return (double)sqrt(ans);
}
double Max(double pos){
double ans=0;
for(int i=0;i<n;i++){
for(int j=i+1;j<n;j++){
ans=max(ans,dis(i,j,pos));
//printf("i:%d j:%d dis:%.2f\n",i,j,dis(i,j,pos));
}
}
//printf("t:%.2f ans:%.2f\n",pos,ans);
return ans;
}
int main(){
int T;
int t=1;
scanf("%d",&T);
while(T--){
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%lf %lf %lf %lf",&num[i].x,&num[i].y,&num[i].vx,&num[i].vy);
}
double l=0,r=1000000,m1,m2,
mmid;
while(r-l>=eps){
m1=l+(r-l)/3;
m2=r-(r-l)/3;
if(Max(m1)<=Max(m2))
r=m2;
else
l=m1;
}
printf("Case #%d: %.2f %.2f\n",t++,l,Max(l));
}
return 0;
}
二分的,,她是在二分时间比较相邻的极其近的两个点,感觉应该还是极值,只不过比较的两个点比较近,不像是之前的三分,直接l mid mmid r,这样的四个点,而是在l ,mid ,mid+eps,r这样的四个点,感觉和三分没什么区别
#include <cstdio>
#include <cstring>
#include <cmath>
#define eps 1e-5
double flag, pos;
double x[310], y[310], vx[310], vy[310];
double cal(double x1, double y1, double x2, double y2)
{
return sqrt((x1 - x2)*(x1 - x2) + (y1 - y2)*(y1 - y2));
}
void solve(int n)
{
pos = 0, flag = 1e7;
double l = 0, r = 1e8;
while(l<=r)
{
double mid = (l + r)/2;
double X = 0, Y = 0, Z = 0;
for(int i = 0; i < n; ++i)
for(int j = i + 1; j < n; ++j)
{
double a = cal(x[i] + vx[i] * mid, y[i] + vy[i] * mid, x[j] + vx[j] * mid, y[j] + vy[j] * mid);
double b = cal(x[i] + vx[i] * (mid + eps), y[i] + vy[i] * (mid + eps), x[j] + vx[j] * (mid + eps), y[j] + vy[j] * (mid + eps));
if(a > X) X = a;
if(b > Y) Y = b;
}
if(flag > X) flag = X, pos = mid;
if(X > Y) l= mid + eps;
else r = mid - eps;
}
}
int main()
{
int t, cnt = 1, n;
scanf("%d",&t);
while(t--)
{
scanf("%d", &n);
for(int i = 0; i < n; ++i)
scanf("%lf %lf %lf %lf", &x[i], &y[i], &vx[i], &vy[i]);
solve(n);
printf("Case #%d: %.2lf %.2lf\n", cnt++, pos, flag);
}
return 0;
}