比赛 |
2025暑假集训第一场 |
评测结果 |
TTTTTATTAA |
题目名称 |
绝世好题 |
最终得分 |
30 |
用户昵称 |
LikableP |
运行时间 |
13.996 s |
代码语言 |
C++ |
内存使用 |
2.08 MiB |
提交时间 |
2025-06-25 10:33:58 |
显示代码纯文本
#include <cstdio>
#define isdigit(ch) ((ch) >= '0' && (ch) <= '9')
namespace IO {
template <typename T>
T read() {
T res = 0, f = 1;
char ch = getchar();
for (; !isdigit(ch); ch = getchar())
if (ch == '-')
f = -1;
for (; isdigit(ch); ch = getchar())
res = (res << 3) + (res << 1) + (ch ^ 48);
return res * f;
}
template <typename T>
void write(T x, char ed = '\n') {
if (x < 0)
x = -x, putchar('-');
static int sta[sizeof(T) << 2], top = 0;
do {
sta[++top] = x % 10;
x /= 10;
} while (x);
while (top) {
putchar(sta[top--] ^ 48);
}
putchar(ed);
}
} // namespace IO
using namespace IO;
const int MAXN = 1e5 + 10;
int n;
int a[MAXN];
int cover[MAXN];
int ans;
bool ok;
void dfs(int now, int len) {
if (ok)
return;
if (now == len + 1) {
ans = len;
ok = true;
return;
}
for (int i = cover[now - 1] + 1; i <= n; ++i) {
if (a[cover[now - 1]] & a[i]) {
cover[now] = i;
dfs(now + 1, len);
if (ok)
return;
}
}
}
int main() {
freopen("bzoj_4300.in", "r", stdin);
freopen("bzoj_4300.out", "w", stdout);
n = read<int>();
for (int i = 1; i <= n; ++i) {
a[i] = read<int>();
}
a[0] = 0x7fffffff;
int l = 1, r = n, ans;
while (l < r) {
int mid = l + ((r - l) >> 1);
ok = false;
dfs(1, mid);
if (ok) {
ans = mid;
l = mid + 1;
} else {
r = mid - 1;
}
}
write(ans);
return 0;
}