CF 373/Div.2/E — Sasha and Array

Revision en1, by i_love_emilia_clarke, 2016-09-24 11:17:39

Hi, i was trying to solve this PROBLEM, i am familiar with segment tree and lazy propagation stuff, what i could not see how to perform update operation.

I feel that we need to store the fibonacci sum of segment at each node, or do we need to store something else ? elaborative explanation will be highly appreciated. Thanks in advance.

Tags segment tree, fibonacci


  Rev. Lang. By When Δ Comment
en1 English i_love_emilia_clarke 2016-09-24 11:17:39 422 Initial revision (published)