| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 160 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | Dominater069 | 154 |
| 8 | awoo | 154 |
| 10 | luogu_official | 151 |
Number of subarrays with sum exactly = k.
Given an array a[] = {1, 1 ,1 , -1} . you have to find all the subarrays of the given array whose sum is exactly = k.
There is an geeks_article for it but the explanation is not
good and clear and also without proof . Can anyone explain me how to solve this problem with some explanation !
Thanks !
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en5 |
|
a_journey | 2019-02-05 15:22:55 | 11 | Tiny change: ' 1 , -1 } \n\nAns =' -> ' 1 , -1 } and k = 1 \n\nAns =' | |
| en4 |
|
a_journey | 2019-02-05 15:20:39 | 81 | ||
| en3 |
|
a_journey | 2019-02-05 15:18:17 | 6 | ||
| en2 |
|
a_journey | 2019-02-05 15:17:44 | 4 | Tiny change: 'xactly =_ ****k.\n\n\nTh' -> 'xactly =_ k.\n\n\nTh' | |
| en1 |
|
a_journey | 2019-02-05 15:17:25 | 430 | Initial revision (published) |
