BZOJ 3831: [Poi2014]Little Bird

很好想的一个$dp$
$f[i]=min\{f[i-k]+a[i-k]\le a[i]\}$
然后$O(n^2)$的啃腚会狂T
单调队列优化一下
当俩个地方代价相同的时候，维护高的，一样高就留后面的
当俩个地方代价不同，维护代价小的

---

#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#define g getchar()
#define ll long long
#define inf 0x3f3f3f3f
using namespace std;
inline ll read(){
    ll x=0,f=1;char ch=g;
    for(;ch<'0'||ch>'9';ch=g)if(ch=='-')f=-1;
    for(;ch>='0'&&ch<='9';ch=g)x=x*10+ch-'0';
    return x*f;
}
inline void out(ll x){
    int a[25],t=0;
    if(x<0)putchar('-'),x=-x;
    for(;x;x/=10)a[++t]=x%10;
    for(int i=t;i;--i)putchar('0'+a[i]);
    if(t==0)putchar('0');
    putchar('\n');
}
struct re{int v;double p;}a[205];
int n,L,sum[250],k,cnt;
double f[205][205][205];
double dfs(int now,int win,int v){
    if(now>n){
        if(win>=L&&v>=0)return f[now][win][v]=1;
        else return 0;
    }
    if(v<0)return f[now][win][v]=0;
    if(L-win>n-now+1)return f[now][win][v]=0;
    if(f[now][win][v]>-1)return f[now][win][v];
//  if(win>=L&&v>=sum[now])return f[now][win][v]=1;
    f[now][win][v]=0;
    f[now][win][v]+=dfs(now+1,win+1,v+a[now].v>200?200:v+a[now].v)*a[now].p;
    f[now][win][v]+=dfs(now+1,win,v)*(1-a[now].p);
    return f[now][win][v];
}
inline bool cmp(re x,re y){return x.v==y.v?x.p>y.p:x.v>y.v;}
int main(){
//  freopen("guard10.in","r",stdin);
//  freopen("guard.out","w",stdout);
    n=read();L=read();k=read();k=k>200?200:k;
    for(int i=1;i<=n;++i){scanf("%lf",&a[i].p);a[i].p/=100.0;}
    for(int i=1;i<=n;++i){a[i].v=read();if(a[i].v==-1)++cnt;}
    sort(a+1,a+1+n,cmp);
    for(int i=0;i<=202;++i)for(int j=0;j<=202;++j)for(int k=0;k<=202;++k)f[i][j][k]=-1;
    for(int i=n;i;--i)if(a[i].v==-1)sum[i]=sum[i+1]-a[i].v;else sum[i]=sum[i+1];
    dfs(1,0,k);
    printf("%.6lf\n",f[1][0][k]);
    return 0;
}