new9934's blog

By new9934, history, 2 years ago, In English

How can I find out bitwise OR of elements of all possible strictly increasing subsequences present in an array? i have to find out that subsequence also.

Constraints

1≤T≤ 10

1<=N<=10^4

0 ≤ arri ≤ 500

Full text and comments »

  • Vote: I like it
  • -16
  • Vote: I do not like it