Need hints in few Segment Tree problems.
Difference between en1 and en2, changed 81 character(s)
1.[DQUERY](https://www.spoj.com/problems/DQUERY/)↵
I know , it can be done using Mo's algorithm , but I need some hints to solve this using segment tree only. I even tried but It gave WA.↵
[Mycode](https://
www.spoj.com/submit/DQUERY/id=28225084ideone.com/Uc7OYv)↵
<br />↵
2.[ANDROUND &mdash; AND Rounds](https://www.spoj.com/problems/ANDROUND/)↵
<br />↵
3.[NICEDAY](https://www.spoj.com/problems/NICEDAY/)↵
I tried this but again it gave me WA. But I think , my approach was wrong.↵
[My code](https://
www.spoj.com/submit/NICEDAY/id=28221728ideone.com/jRewBt)↵
<br />↵
Thanks a lot in advance.↵

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English mohit_joshi 2021-07-25 03:08:21 81
en1 English mohit_joshi 2021-07-24 19:38:31 600 Initial revision (published)