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 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | turmax | 3559 |
| 6 | tourist | 3541 |
| 7 | strapple | 3515 |
| 8 | ksun48 | 3461 |
| 9 | dXqwq | 3436 |
| 10 | Otomachi_Una | 3413 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 147 |
| 3 | Proof_by_QED | 147 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 142 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
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