bzoj4300: 绝世好题

用一个数组E[32]记录该位是1的最后一个数的编号，读入一个数之后更新。

http://www.lydsy.com/JudgeOnline/problem.php?id=4300

/**************************************************************
    Problem: 4300
    User: 1349367067
    Language: C++
    Result: Accepted
    Time:80 ms
    Memory:1196 kb
****************************************************************/
 
#include<cstdio>
int n;
int f[100011]={};
int E[33]={};
int main()
{
    scanf("%d",&n);
    int t,m,h;
    for (int i=1;i<=n;i++)
    {
        scanf("%d",&t);
        m=0;
        while (t!=0)
        {
              m++;
              h=t%2;t=t/2;
              if (h==1)
              {
                       if (f[E[m]]+1>f[i])
                          f[i]=f[E[m]]+1;
                       E[m]=i;
              }
        }
    }
    for (int i=1;i<=n;i++)
        if (f[i]<f[i-1]) f[i]=f[i-1];
    printf("%d",f[n]);
     
    //system("pause");
    return 0;
}

View Code

 

转载于:https://www.cnblogs.com/3ZStarve/p/4893112.html