uva 3708 - Graveyard

题目： https://icpcarchive.ecs.baylor.edu/external/37/3708.pdf

分析样例，会发现初始点中  总有一个点没动。

const int INF =0x3f3f3f3f;
const int maxn=  2000+10  ;
//const int maxm=    ;
//by yskysker123
double a[1010];
double b[maxn];
const double L= 10000;
int n,m;
int work(int le,int ri,double x)  //开始这里写成了int ，汗
{
    while(le<=ri)
    {
        int mid=(le+ri)/2;
        if(b[mid]<x)  le=mid+1;
        else ri=mid-1;
    }
    return le;
}


int main()
{
  while(~scanf("%d%d",&n,&m))
  {
      m+=n;
      a[0]=0;
      double len=L/n;
      for(int i=2;i<=n;i++)
      {
          a[i]= (i-1)*len;
      }
             len=L/m;
      b[0]=0;
      for(int i=2;i<=m;i++)
      {
          b[i]=(i-1)*len;
      }
      double ans=0;
      for(int i=2;i<=n;i++)
      {
          int p=work(1,m,a[i]);
          ans+=min( b[p]-a[i],a[i]-b[p-1]   );
      }
      printf("%.4lf\n",ans);



  }

    return 0;
}

#include<cstdio>
#include<string>
#include<cstring>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<climits>
#include<queue>
#include<vector>
#include<map>
#include<sstream>
#include<set>
#include<stack>
#include<utility>
#pragma comment(linker, "/STACK:102400000,102400000")
#define PI 3.1415926535897932384626
#define eps 1e-10
#define sqr(x) ((x)*(x))
#define FOR0(i,n)  for(int i=0 ;i<(n) ;i++)
#define FOR1(i,n)  for(int i=1 ;i<=(n) ;i++)
#define FORD(i,n)  for(int i=(n) ;i>=0 ;i--)
#define  lson   num<<1,le,mid
#define rson    num<<1|1,mid+1,ri
#define MID   int mid=(le+ri)>>1
#define zero(x)((x>0? x:-x)<1e-15)
#define mk    make_pair
#define _f     first
#define _s     second

using namespace std;
//const int INF=    ;
typedef long long ll;
//const ll inf =1000000000000000;//1e15;
//ifstream fin("input.txt");
//ofstream fout("output.txt");
//fin.close();
//fout.close();
//freopen("a.in","r",stdin);
//freopen("a.out","w",stdout);