[WQS二分套WQS二分] Codeforces #739E. Gosha is hunting

$O(n^3)$ $DP$ 很显然。要优化就只能 $WQS$ 二分了。每种食物肯定是都用完的，所以相当于强制选若干个 $A$ 物品，若干个 $B$ 物品。发现物品选越多，收益是会增加的越来越慢的，所以这两维都可以 $WQS$ 二分。就能做到 $O(nlog^2 n)$ ,很优美。
http://codeforces.com/blog/entry/49691

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=2005;
int n,A,B,num_a[maxn],num_b[maxn];
double a[maxn],b[maxn],f[maxn];

void Solve(double cA,double cB){
    f[0]=0; num_a[0]=num_b[0]=0;
    for(int i=1;i<=n;i++){
        f[i]=f[i-1]; num_a[i]=num_a[i-1]; num_b[i]=num_b[i-1];
        if(f[i-1]+a[i]-cA>f[i]){
            f[i]=f[i-1]+a[i]-cA;
            num_a[i]=num_a[i-1]+1; num_b[i]=num_b[i-1];
        }
        if(f[i-1]+b[i]-cB>f[i]){
            f[i]=f[i-1]+b[i]-cB;
            num_a[i]=num_a[i-1]; num_b[i]=num_b[i-1]+1;
        }
        if(f[i-1]+1-(1-a[i])*(1-b[i])-cA-cB>f[i]){
            f[i]=f[i-1]+1-(1-a[i])*(1-b[i])-cA-cB;
            num_a[i]=num_a[i-1]+1; num_b[i]=num_b[i-1]+1;
        }
    }
}
int main(){
    freopen("cf739E.in","r",stdin);
    freopen("cf739E.out","w",stdout);
    scanf("%d%d%d",&n,&A,&B);
    for(int i=1;i<=n;i++) scanf("%lf",&a[i]);
    for(int i=1;i<=n;i++) scanf("%lf",&b[i]);
    double L1=0,R1=1,mid1,L2=0,R2=1,mid2;
    while(R1-L1>=0.00000001){
        mid1=(L1+R1)/2;
        L2=0,R2=1;
        while(R2-L2>=0.00000001){
            mid2=(L2+R2)/2;
            if((Solve(mid1,mid2),num_b[n])>B) L2=mid2; else R2=mid2;    
        }
        if((Solve(mid1,R2),num_a[n])>A) L1=mid1; else R1=mid1;
    }
    Solve(R1,R2); printf("%.5lf\n",f[n]+R1*A+R2*B);
    return 0;
}