51nod 1577 线性基

思路：

http://blog.csdn.net/yxuanwkeith/article/details/53524757

//By SiriusRen
#include <bits/stdc++.h>
using namespace std;
const int N=;
int n,m,a[N];
inline int read(){
    int x=;char p=getchar();
    while(p<''||p>'')p=getchar();
    while(p>=''&&p<='')x=x*+p-'',p=getchar();
    return x;
}
struct Node{int wei,id;Node(){}Node(int x,int y){wei=x,id=y;}}f[N][];
int main(){
    scanf("%d",&n);
    for(int i=;i<=n;i++)a[i]=read();
    for(int i=n;i;i--){
        memcpy(f[i],f[i+],sizeof(f[i]));
        Node now=Node(a[i],i);
        for(int j=;~j;j--)if(now.wei&(<<j)){
            if(f[i][j].wei){
                if(now.id<f[i][j].id)swap(f[i][j],now);
                now.wei^=f[i][j].wei;
            }
            else{
                f[i][j]=now;
                break;
            }
        }
    }
    scanf("%d",&m);
    while(m--){
        int l,r,x;
        l=read(),r=read(),x=read();
        for(int i=;~i;i--)if(x&(<<i)){
            if(!f[l][i].wei||f[l][i].id>r)break;
            x^=f[l][i].wei;
        }
        puts(!x?"YES":"NO");
    }
}