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 — 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.↵
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://
<br />↵
2.[ANDROUND — 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://
<br />↵
Thanks a lot in advance.↵