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??
# | User | Rating |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | TheScrasse | 160 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | orz | 146 |
9 | pajenegod | 145 |
9 | SecondThread | 145 |
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??
Name |
---|
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 :)