QOJ.ac
QOJ
| ID | Submission ID | Problem | Hacker | Owner | Result | Submit time | Judge time |
|---|---|---|---|---|---|---|---|
| #409 | #215742 | #21792. 【NOIP Round #6】抉择 | yzl | liyelin | Failed. | 2023-10-15 18:08:49 | 2023-10-15 18:08:49 |
Details
Extra Test:
Accepted
time: 1ms
memory: 5752kb
input:
1 0
output:
0
result:
ok 1 number(s): "0"
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #215742 | #21792. 【NOIP Round #6】抉择 | liyelin | 100 ✓ | 224ms | 19228kb | C++14 | 475b | 2023-10-15 13:19:46 | 2023-10-15 13:19:46 |
answer
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
const int B = 61;
typedef long long ll;
int n, p[B];
ll a[N], ans, f[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
f[i] = 0;
for (int j = B - 1; j >= 0; j--) {
f[i] = max(f[i], f[p[j]] + (a[p[j]] & a[i]));
if ((a[i] >> j) & 1) p[j] = i;
}
ans = max(ans, f[i]);
}
cout << ans << endl;
return 0;
}