bzoj3652 大新闻（数位DP）

传送门：http://www.lydsy.com/JudgeOnline/problem.php?id=3652

第一问只用统计出所有位1的个数即可。第二问我们用记忆化搜索。dp[len][cur][l]表示当前长度为len。若cur为1，则表示当前随机生成的数沿着上界。若l为1，则表示当前构造的数沿着上界。这种状况下答案的值。转移显然。

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<vector>
#include<bitset>

using namespace std;
typedef long long LL;
LL n,nn;
const double eps=1e-10;
double p;
double dp[110][2][2];
double nu[110][2][2];
int a[1100],m;
double num[110],ans;
double work(int len,int cur,int l)
{
    if (dp[len][cur][l]>-1+eps) return dp[len][cur][l];
    if (len==0)
    {
        nu[len][cur][l]=1.0;
        return dp[len][cur][l]=0.0;
    }
    dp[len][cur][l]=0;
    double n0,n1=0;
    int ncur;
    if (cur&&a[len-1]==0) ncur=1;
    else ncur=0;
    if (l)
    {
        if (a[len-1]==1) dp[len][cur][l]+=work(len-1,ncur,1),n0=nu[len-1][ncur][1],dp[len][cur][l]+=n0*num[len-1];
        else dp[len][cur][l]+=work(len-1,ncur,1),n0=nu[len-1][ncur][1];
    }
    else dp[len][cur][l]+=work(len-1,ncur,0),n0=nu[len-1][ncur][0],dp[len][cur][l]+=n0*num[len-1];
    if (!cur||a[len-1]==1)
    {
        if (cur)
        {
            if (l&&a[len-1]==0) dp[len][cur][l]+=work(len-1,1,1),n1=nu[len-1][1][1];
            else dp[len][cur][l]+=work(len-1,1,0),n1=nu[len-1][1][0];
        }
        else 
        {
            if (l&&a[len-1]==0) dp[len][cur][l]+=work(len-1,0,1),n1=nu[len-1][0][1];
            else dp[len][cur][l]+=work(len-1,0,0),n1=nu[len-1][0][0];
        }
        dp[len][cur][l]+=n1*num[len-1];
    }
    nu[len][cur][l]=n1+n0;
    return dp[len][cur][l];
}
LL c;
double f[110][2]; 
void work2()
{
    for (int i=m-1;i>=0;i--)
    {
        if (a[i]==1)
        {
            f[i][1]+=c-num[i]+1;
            f[i][0]+=num[i];
            if (i)
            {
                for (int j=0;j<i;j++)
                    f[j][0]+=num[i-1],f[j][1]+=num[i-1];
            }
            c-=num[i];
        }
        else
        {
            f[i][0]+=c+1;
        }
    }   
}   
int main()
{
    cin>>n>>p;
    nn=n;
    nn--,n--;
    num[0]=1.0;
    for (int i=1;i<=64;i++)
        num[i]=num[i-1]*2.0;
    memset(dp,-1,sizeof(dp));
    while(nn) a[m++]=nn&1,nn>>=1;
    ans=p*work(m,1,1)/(double)(n+1);
    c=n;
    work2();
    for (int i=0;i<=64;i++)
        ans+=(1.0-p)*f[i][0]*f[i][1]*num[i]*2.0/(double)(n+1)/(double)(n+1);
    printf("%lf\n",ans);
    return 0;
}