Problem link: http://www.spoj.com/problems/XXXXXXXX/
Solution Link: http://ideone.com/Myb8M6
Can someone help me debug my solution? I am trying to use segtree + treap in the code.
Thanks.
Codeforces Round 1133 (Div. 1, Div. 2) is coming soon! Register here.
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 134 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Nov/07/2026 16:50:58 (g2).
Desktop version, switch to mobile version.
Supported by
Got the mistake. It was int -> long long mistake.
Can you please explain your approach.
I have used the approach explained in the comment http://codeforces.me/blog/entry/10508?#comment-158835
while updating i for A[i], I add the value A[i] to the point representing (i, left[i]) where left[i] denotes the greatest j s.t. A[j] == A[i] & j < i. If no such j exists, then left[i] = 0.
Now for query, I found the sum in (L,0) to (R,L-1) both included.
Updated code with int -> long long correction: http://ideone.com/sJMdlW
Thanks for the link.I guess instead of using treap we can also use square root decomposition with a bit in each block.
Yes, that should also work but I am not sure whether it will pass the time limit (Q * sqrtN * logN solution) as spoj is relatively more time-strict than any other sites I know.
Well -3 seems like downvoted to me...
It was 0 when I came and we all know that -3 is nothing compared to what a green coder would receive.
True.
Well, I did not personally ask you or anyone to debug the code.
I only posted it as a question. So, if someone will be available to debug it, he/she will and will tell me my mistake. You or Anyone for that matter had any obligation to see the code and try to find a bug.
Look at yourself before you start looking at others.
http://codeforces.me/blog/entry/16231
Hm I believe he was blue at that time. Also his question was not a direct saying "Please debug my code".