C++14(g++5.4) 解法, 执行用时: 82ms, 内存消耗: 2540K, 提交时间: 2020-05-06 09:51:36

#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int MX=3e5+9;
int n,m,x;
ll a[MX];

int solve(int x,int r){
    ll mx=0,huo=0;
    for( int i=r ; i>=1 ; i-- ){
        mx=max(mx,a[i]);
        huo|=a[i];
        if( huo>mx && i<=x )
            return r-i+1;
    }
    return -1;
}

int main()
{
//    freopen("input.txt","r",stdin);
    scanf("%d %d",&n,&m);
    for( int i=1 ; i<=n ; i++ )
        scanf("%lld",&a[i]);
    while( m-- ){
        scanf("%d",&x);
        ll huo=0;
        int r=n,ans=-1;
        for( int i=x ; i<=r ; i++ ){
            if( huo|a[i]!=huo ){
                huo|=a[i];
                int temp=solve(x,i);
                if( temp==-1 )
                    continue;
                if( ans==-1 )
                    ans=temp;
                else 
                    ans=min(ans,temp);
                r=min(r,i+ans+1);
            }
        }
        printf("%d\n",ans);
    }
    return 0;
}

C++11(clang++ 3.9) 解法, 执行用时: 52ms, 内存消耗: 1764K, 提交时间: 2020-05-02 21:47:44

#include<bits/stdc++.h>
#define ll long long
using namespace std;

inline ll read(){
	ll num=0,neg=1;char c=getchar();
	while(!isdigit(c)){if(c=='-')neg=-1;c=getchar();}
	while(isdigit(c)){num=(num<<3)+(num<<1)+c-'0';c=getchar();}
	return num*neg;
}

int n,Q,a[300010];

inline int solve(int now,int x){
	int tmp=0,res=0;
	for(int i=now;i>=1;i--){
		tmp=max(tmp,a[i]);res|=a[i];
		if(res>tmp&&i<=x) return now-i+1;
	}return -1;
}

int main(){
	n=read(),Q=read();
	for(int i=1;i<=n;i++) a[i]=read();
	while(Q--)
	{
		int x=read(),now=0,ans=-1,r=n;
		for(int i=x;i<=r;i++)
			if((now|a[i])!=now){
				now|=a[i];
				int tmp=solve(i,x);
				if(tmp==-1) continue;
				if(ans==-1) ans=tmp;
				else ans=min(ans,tmp);
				r=min(r,x+ans+1);
			}
		printf("%d\n",ans);
	}return 0;
	
}