let array A = {1,3,1,1,1,4,0,0,2,3,1,}
We have to do following 2 operations on it
1.)Decrease all elements from L to R by 1
2.)Given i find right most element j such that for each k. i <= k <= j. A[k] > 0
how can i do this in log(N)
?
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 165 |
3 | adamant | 163 |
4 | TheScrasse | 160 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
let array A = {1,3,1,1,1,4,0,0,2,3,1,}
We have to do following 2 operations on it
1.)Decrease all elements from L to R by 1
2.)Given i find right most element j such that for each k. i <= k <= j. A[k] > 0
how can i do this in log(N)
?
Название |
---|
yeah use binary search
Stop learning useless algorithms, go and solve some problems, learn how to use binary search — by (You know this :p)
i didn't asked for suggestion. go and solve Watermelon problem :p