4300: 絕世好題
Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 1893 Solved: 990
[Submit][Status][Discuss]
Description
Input
Output
Sample Input
1 2 3
Sample Output
HINT
n<=100000,ai<=2*10^9
Source
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#define M 100100
using namespace std;
int n,ans;
int f[32];
int main()
{
int i,j,x;
cin>>n;
for(i=1;i<=n;i++)
{
scanf("%d",&x);
int temp=0;
for(j=0;j<=30;j++)
if(x&(1<<j))
temp=max(temp,f[j]+1);
for(j=0;j<=30;j++)
if(x&(1<<j))
f[j]=temp;
ans=max(ans,temp);
}
cout<<ans<<endl;
return 0;
}