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)
?
# | User | Rating |
---|---|---|
1 | jiangly | 3976 |
2 | tourist | 3815 |
3 | jqdai0815 | 3682 |
4 | ksun48 | 3614 |
5 | orzdevinwang | 3526 |
6 | ecnerwala | 3514 |
7 | Benq | 3482 |
8 | hos.lyric | 3382 |
9 | gamegame | 3374 |
10 | heuristica | 3357 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | -is-this-fft- | 165 |
3 | atcoder_official | 160 |
3 | Um_nik | 160 |
5 | djm03178 | 157 |
6 | Dominater069 | 156 |
7 | adamant | 153 |
8 | luogu_official | 152 |
9 | awoo | 151 |
10 | TheScrasse | 147 |
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)
?
Name |
---|
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