BZOJ 4300(绝世好题-dp)

求一个序列的，满足$bi$&$bi-1!=0$的最长子序列
1<=n<=100000，ai<=10^9

乱搞

#include<bits/stdc++.h>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=Pre[x];p;p=Next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=Next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,127,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define INF (2139062143)
#define F (100000007)
#define pb push_back
#define mp make_pair 
#define fi first
#define se second
#define MAXN (100000+10)
typedef long long ll;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return (a-b+llabs(a-b)/F*F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
int read()
{
    int x=0,f=1; char ch=getchar();
    while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
    while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
    return x*f;
} 
int a[MAXN],n,f[33]={0};
int main()
{
//  freopen("bzoj4300.in","r",stdin);
//  freopen(".out","w",stdout);
    cin>>n;
    For(i,n) a[i]=read();
    For(i,n) {
        int t=0;
        Rep(j,31) {
            if (a[i]&(1<<j)) t=max(t,f[j]+1); 
        }       
        Rep(j,31) {
            if (a[i]&(1<<j)) f[j]=max(f[j],t); 
        }       
    }
    int ans=1;
    Rep(j,31) {
        ans=max(ans,f[j]); 
    }       
    cout<<ans<<endl;
    return 0;
}