0
点赞
收藏
分享

微信扫一扫

BZOJ 4300(绝世好题-dp)

人间四月天i 2022-10-25 阅读 61


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

乱搞

#include<bits/stdc++.h>
using namespace std;
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
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;
}


举报

相关推荐

0 条评论