题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=6240
思路:看见这个式子很容易想到01分数规划,01分数规划其实就是二分一个答案,然后吧分母乘过来,再移个项,由于本题要覆盖整个区间,很明显的是价值小于0的区间可以全选,那么问题就变为花费最少的代价覆盖剩余的点,这个东西dp加上树状数组维护最小值优化一下就好,我这个维护的是前缀最小值,所以坐标变动了一下,直接维护后缀其实也可以
https://www.cnblogs.com/orzzz/p/7461871.html
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <bitset>
#include <cmath>
#include <cctype>
#include <iostream>
#include <unordered_map>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <sstream>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll inff = 0x3f3f3f3f3f3f3f3f;
#define FOR(i,a,b) for(int i(a);i<=(b);++i)
#define FOL(i,a,b) for(int i(a);i>=(b);--i)
#define REW(a,b) memset(a,b,sizeof(a))
#define inf int(0x3f3f3f3f)
#define si(a) scanf("%d",&a)
#define sl(a) scanf("%lld",&a)
#define sd(a) scanf("%lf",&a)
#define ss(a) scanf("%s",a)
#define mod ll(998244353)
#define pb push_back
#define eps 1e-6
#define lc d<<1
#define rc d<<1|1
#define Pll pair<ll,ll>
#define P pair<int,int>
#define pi acos(-1)
int t,n,tt;
double b[100008];
struct as{
int s,t;
double a,b;}a[100008];
bool cmp(as a,as b){return a.s<b.s;}
double sum(int x)
{
if(x==t+1) return 0;
double ans=1e9;
while(x>0) ans=min(ans,b[x]),x-=x&-x;
return ans;
}
void add(int x,double y) {while(x<=t) b[x]=min(b[x],y),x+=x&-x;}
bool asa(double x)
{
fill(b+1,b+t+1,inf);
double qw=0.0,zz;
FOR(i,1,n)
{
zz=sum(t-a[i].s+2);
if(a[i].a-x*a[i].b<=eps) qw+=x*a[i].b-a[i].a;
else zz+=a[i].a-x*a[i].b;
add(t-a[i].t+1,zz);
}
return sum(1)<=qw;
}
int main()
{
cin.tie(0);
cout.tie(0);
cin>>tt;
while(tt--)
{
cin>>n>>t;
FOR(i,1,n) si(a[i].s),si(a[i].t),sd(a[i].a),sd(a[i].b);
double l=0.0,r=1000.0,ans;
sort(a+1,a+n+1,cmp);
FOR(i,1,28)
{
double mid=(l+r)/2.0;
if(asa(mid)) ans=mid,r=mid;
else l=mid;
}
printf("%.3lf\n",ans);
}
return 0;
}