CodeForces 1592E :Bored Bakry 二进制 + 思维

传送门

题意

给定一个 $n$ 个数的数组，要求找一个连续子区间，满足该子区间的区间 $\&$ 和 $>$ 区间异或和。求该子区间的最大长度。

分析

二进制常见的处理方式就是进行拆位处理
首先如果是大于的话，那么就要求第$k$位的异或和大于$\&$，然后大于第$k$位的异或和为0

代码

#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 2e6 + 10;
const ll mod = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
    char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
    while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
int num[N],sum[N];
int a[N];
int st[N];
int n;

int main() {
    read(n);
    for(int i = 1;i <= n;i++) read(a[i]);
    int ans = 0;
    for(int j = 20;~j;j--){
        for(int i = 1;i <= n;i++){
            num[i] = num[i - 1] + (a[i] >> j & 1);
            sum[i] = sum[i - 1] ^ (a[i] >> j);
        }
        memset(st,-1,sizeof st);
        st[0] = 0;
        for(int i = 1;i <= n;i++){
            if(st[sum[i]] != -1){
                if(num[i] - num[st[sum[i]]] == i - st[sum[i]]){
                    cout << i << ' ' << st[sum[i]] << endl;
                    ans = max(ans,i - st[sum[i]]);
                }
                else st[sum[i]] = i;
            }
            else st[sum[i]] = i;
        }
    }
    di(ans);
    return 0;
}