Hi everyone, I'm trying to solve 316E3 - Задание на лето. Despite reading the tutorial link, I could't understand clearly the solution. Could you explain me more detail??
Hi everyone, I'm trying to solve 316E3 - Задание на лето. Despite reading the tutorial link, I could't understand clearly the solution. Could you explain me more detail??
The key is the merging step
While merging and , we need to shift the Fibonacci multiplier of the second one by (l2 - r1) to the right , so that we get
Shifting can be done by using identity Fn + m = FnFm - 1 + Fn + 1Fm
F[n+m+1] = F[n]*F[m-1] + F[n+1]*F[m] ??
Yes. Proof can be found from matrix exponentiation, or by induction here
Then make 2 segtree, for maintain (supposed to be
seg1
) and (supposed to beseg2
).Sorry if this explanation seems unclear. More detail you can check my submission 7338693
wow, I've got it. Thanks you very much :)