Hi everyone, I'm trying to solve 316E3 - Summer Homework. Despite reading the tutorial link, I could't understand clearly the solution. Could you explain me more detail??
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | maomao90 | 163 |
2 | Um_nik | 163 |
4 | atcoder_official | 161 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | nor | 153 |
9 | Dominater069 | 153 |
Hi everyone, I'm trying to solve 316E3 - Summer Homework. 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 :)