XorSubstrings

Revision en1, by Tudor, 2015-10-15 19:26:27

It is an array with n elements and d[i] = how many substrings have XOR value i. What is the optimal algorithm for build this dp? substring = a[i1] , a[i2] , ... not contigous.

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English Tudor 2015-10-15 19:26:27 191 Initial revision (published)