ACdream1092

这题先按出现的时间对地鼠们进行排序，然后如果两个地鼠i,j的距离小于或等于两个地鼠的相距出现的时间与速度的乘积

dis(i,j)<=v*(t[i]-t[j])

那么就从j向i连一条有向边，于是就构成一个DAG（有向无环图）,意味着这道题可以用动态规划解决

代码附在下面：

#include<iostream>
#include<algorithm>
#include<cstring>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<stdio.h>
#include<stdlib.h>
#include<ctype.h>
#include<time.h>
#include<math.h>

#define N 1005
#define inf 0x7fffffff
#define eps 1e-9
#define pi acos(-1.0)
#define P system("pause")
using namespace std;
struct node
{
    double x,y,t,gl;
}s[N],dp[N];
//dp[i]表示前i个实现的最大期望
bool cmp(node a,node b)
{
    return a.t < b.t;
}

int main()
{
//freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
    int t;
    scanf("%d",&t);
    while(t--)
    {
         int n;
         int i,j;
         double v;
         scanf("%d%lf",&n,&v);
         for(i = 0; i < n; i++)
            scanf("%lf%lf%lf%lf",&s[i].x,&s[i].y,&s[i].t,&s[i].gl);
         sort(s,s+n,cmp);

        // for(i = 0; i < n; i++)
          //   cout<<s[i].t<<" "<<s[i].gl<<endl;

         for(i = 0; i < n; i++)
            dp[i].gl = 0;
        // dp[0].x = s[0].x; dp[0].y = s[0].y;
         //dp[0].t = s[0].t; dp[0].gl = s[0].gl;
         double res = 0;
       //  cout<<res<<endl;
         for(i = 0; i < n; i++)
         {
            dp[i] = s[i];
            for(j = 0; j < i; j++)
            {

                  double dist = sqrt((s[i].x-dp[j].x)*(s[i].x-dp[j].x) + (s[i].y-dp[j].y)*(s[i].y-dp[j].y));
                  double dist1 = v*(s[i].t - dp[j].t);
                  if(dist <= dist1)
                  {
                      dp[i].gl = max(dp[i].gl, dp[j].gl+s[i].gl);
                      dp[i].x = s[i].x; dp[i].y = s[i].y;
                      dp[i].t = s[i].t;
                  }
            }
            if(dp[i].gl > res) res = dp[i].gl;
         }
        // for(i = 0; i < n; i++)
         {
          //   cout<<dp[i].gl<<endl;
         }
         printf("%.6lf\n",res);
    }


    return 0;
}