HDU 5587 Array

71 阅读 0 评论 47 点赞

我是靠谱客的博主大力悟空，这篇文章主要介绍HDU 5587 Array，现在分享给大家，希望可以做个参考。

1
4
7
转换为2进制做类似数位dp就好了
#include<cmath>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long LL;
const int maxn = 1e5 + 5;
int n;
long long m;
long long a[maxn], b[maxn];

void init()
{
    for (int i = a[b[0] = 0] = 1; i <= 100; i++) a[i] = a[i - 1] << 1;
    for (int i = 1; i <= 100; i++) b[i] = (b[i - 1] << 1) + a[i - 1];
    for (int i = 0; i <= 100; i++) a[i]--;
}

long long solve(LL x,LL y)
{
    for (int i = 0; i <= 100; i++) 
    if (x > a[i] && x <= a[i + 1])
    {
        if (x == a[i + 1])    return b[i + 1] + y*a[i + 1];
        else return b[i] + y*(a[i] + 1) + 1 + solve(x - a[i] - 1, y + 1);
    }
}

int main()
{
    init();
    while (scanf("%d", &n) != EOF)
    {
        while (n--)
        {
            scanf("%I64d", &m);
            printf("%I64dn", solve(m, 0));
        }
    }
    return 0;
}