poj3252——数位dp(减去的艺术)

题目链接：https://vjudge.net/problem/POJ-3252

题目大意：求满足区间[l,r]内满足二进制0的个数大于1的个数的数的个数。

题解：设状态dp[pos][sum]表示枚举到第pos个位置，前面的所有数位的数的二进制0的个数减去1的个数。

因此sum可能小于0，且最小为-32，因此我们可以离散化一下，把实际的-32看成0，实际的0看成32，

这样只需要最后枚举到-1时判断一下最后是否大于等于32（其实就是大于等于0）

代码实现：

#pragma GCC optimize(2)
#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#define PI atan(1.0) * 4
#define E 2.718281828
#define rp(i, s, t) for (register int i = (s); i <= (t); i++)
#define RP(i, t, s) for (register int i = (t); i >= (s); i--)
#define ll long long
#define ull unsigned long long
#define mst(a, b) memset(a, b, sizeof(a))
#define lson l, m, rt << 1
#define rson m + 1, r, rt << 1 | 1
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define debug printf("ac\n");
using namespace std;
inline int read()
{
    int a = 0, b = 1;
    char c = getchar();
    while (c < '0' || c > '9')
    {
        if (c == '-')
            b = -1;
        c = getchar();
    }
    while (c >= '0' && c <= '9')
    {
        a = (a << 3) + (a << 1) + c - '0';
        c = getchar();
    }
    return a * b;
}
int a[64],num;
ll dp[36][64];
ll dfs(int pos,int sum,int lead,int limit){
    if(pos==-1) return sum>=32;
    if(!lead&&!limit&&dp[pos][sum]!=-1) return dp[pos][sum];
    int up=limit?a[pos]:1;
    ll ans=0;
    rp(i,0,up){
        if(lead&&i==0) ans+=dfs(pos-1,sum,1,limit&&i==a[pos]);
        else ans+=dfs(pos-1,sum+((i==0)?1:-1),lead&&i==0,limit&&i==a[pos]);
    }
    if(!limit&&!lead) return dp[pos][sum]=ans;
    return ans;
}
ll solve(ll x){
    num=0;
    while(x) a[num++]=x%2,x/=2;
    return dfs(num-1,32,1,1);
}
int main(){
    mst(dp,-1);
    ll l,r;
    while(~scanf("%lld%lld",&l,&r)){
        printf("%lld\n",solve(r)-solve(l-1));
    }
    return 0;
}