Why Wrong Answer in this Problem
I Solved it using Segment tree and lazy propagation
Problem Link : http://www.spoj.com/problems/CDC12_H/
My Solution Link : https://ideone.com/Td4sDM
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | dXqwq | 3436 |
| 8 | Radewoosh | 3415 |
| 9 | Otomachi_Una | 3413 |
| 10 | Um_nik | 3376 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | adamant | 152 |
| 3 | Proof_by_QED | 146 |
| 3 | Um_nik | 146 |
| 5 | Dominater069 | 144 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 9 | TheScrasse | 134 |
Why Wrong Answer in this Problem
I Solved it using Segment tree and lazy propagation
Problem Link : http://www.spoj.com/problems/CDC12_H/
My Solution Link : https://ideone.com/Td4sDM
| Name |
|---|



fill lazy arry with zeroes every test,you don't need build function just fill tree array with zeroes every test ,replace cin,cout with scanf,printf to avoid time limit
Also Getting WA :(
https://ideone.com/NTrbFX
for(int i = 0 ; i < 5*MAX ; ++i) lazy[0] = tree[0] = 0 ;you set first element only https://ideone.com/trqetP
Thanks :)...Got it Accepted