7.12 模拟赛 G 题题解

#include <bits/stdc++.h>
using namespace std;
const int N = 100010;
int cnt[30];
int n, x;
int a[N];

int get() {
	int ans = 0;
	for (int i = 29; i >= 0; i--)
		if (cnt[i] >= 1)
			ans += (1 << i);
	return ans;
}

int main() {
	freopen("wifi.in", "r", stdin);
	int t;
	cin >> t;
	while (t--) {
		cin >> n >> x;
		for (int i = 1; i <= n; i++)
			cin >> a[i];
		for (int i = 0; i <= 29; i++)
			cnt[i] = 0;
		int ans = 0;
		for (int l = 1, r = 0; l <= n; l++) {
			while (r < n) {
				r++;
				for (int i = 0; i <= 29; i++)
					if (a[r] & (1 << i))
						cnt[i]++;
//				cout << l << " " << r << " " << get() << endl;
				if (get() > x) {
					for (int i = 0; i <= 29; i++)
						if (a[r] & (1 << i))
							cnt[i]--;
					r--;
					break;
				}
			}
			if (get() <= x)
				ans = max(ans, r - l + 1);
			for (int i = 0; i <= 29; i++)
				if (a[l] & (1 << i))
					cnt[i]--;
		}
		cout << ans << endl;
	}
	return 0;
}