Hello! I was solving last year's JBOI but I couldn't solve the second problem — palm trees. Can one tell me how to solve it? Thanks
# | User | Rating |
---|---|---|
1 | tourist | 3993 |
2 | jiangly | 3743 |
3 | orzdevinwang | 3707 |
4 | Radewoosh | 3627 |
5 | jqdai0815 | 3620 |
6 | Benq | 3564 |
7 | Kevin114514 | 3443 |
8 | ksun48 | 3434 |
9 | Rewinding | 3397 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 155 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
10 | nor | 152 |
Hello! I was solving last year's JBOI but I couldn't solve the second problem — palm trees. Can one tell me how to solve it? Thanks
Name |
---|
Worst problem ever ;) Ask a.piasta, only he managed to AC it during the competition. Use some segtrees and many special cases. But, seriously, there are more valuable problems tham this shit...
Do we have an alternating sequence craze here now? :P