XorSubstrings

Правка en1, от 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.

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский Tudor 2015-10-15 19:26:27 191 Initial revision (published)