HDU 6156 Palindrome Function 数位DP

传送门：http://acm.hdu.edu.cn/showproblem.php?pid=6156
题意；给你L，R，l，r 求L-R区间的数的x进制 (l<=x<=r)的回文串的数量*进制+这个进制不是回文的数量
思路：计数类DP->数位
code：

#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
LL digit[60], dp[40][60][60], dight;
LL arr[60];
LL dfs(int len, int pos, int sta, int limit)
{
    if(pos == -1 || sta == 0) return sta;
    if(!limit && dp[dight][len][pos] != -1) return dp[dight][len][pos];
    int up = limit ? digit[pos] : dight - 1;
    LL tmp = 0;
    for(int i = 0; i <= up; i++)
    {
        arr[pos] == i;
        if(len == pos && i == 0)
            tmp += dfs(len - 1, pos - 1, sta, limit && (i == up) );
        else if(sta == 1 && pos < (len + 1) / 2)
            tmp += dfs(len, pos - 1, i == digit[len - pos], limit && (i == up));
        else
            tmp += dfs(len, pos - 1, sta, limit && (i == up));
    }
    if(limit == 0) dp[dight][len][pos] = tmp;
    return tmp;
}
LL solve(LL x)
{

    int pos = 0;
    while(x)
    {
        digit[pos++] = x % dight;
        x /= dight;
    }
    return dfs(pos - 1, pos - 1, 1, 1);
}
int main()
{
    int t;
    scanf("%d", &t);
    memset(dp, -1, sizeof dp);
    for(int cas = 1; cas <= t; cas++)
    {
        LL L, R;
        scanf("%lld%lld", &L, &R);
        LL l, r;
        scanf("%lld%lld", &l, &r);
        LL ans = 0;
        for(dight = l; dight <= r; dight++)
        {
            LL num = solve(R) - solve(L - 1);
            ans += num * dight + (R - L + 1 - num);
        }
        printf("Case #%d: %lld\n", cas, ans);
    }
    return 0;
}