I did this question by Segment tree but my solution is throwing TLE. I I think the TC is O(n logn) for larger cases. So I think it should work this way but it is failing. Is it not possible to further optimize it doing this way ?
Help in a question
I did this question by Segment tree but my solution is throwing TLE. I I think the TC is O(n logn) for larger cases. So I think it should work this way but it is failing. Is it not possible to further optimize it doing this way ?
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en2 |
|
shivanshsingh9670 | 2023-03-13 11:18:54 | 3 | Tiny change: '380/C)\n\n\n\n[Submission](https://' | |
| en1 |
|
shivanshsingh9670 | 2023-03-13 11:17:06 | 388 | Initial revision (published) |