| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 166 |
| 2 | maomao90 | 163 |
| 2 | Um_nik | 163 |
| 4 | atcoder_official | 161 |
| 5 | adamant | 160 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | nor | 153 |
| 9 | Dominater069 | 153 |
Problem Link — https://www.hackerrank.com/contests/csindia14-er1/challenges/fill-the-tank
Given an array of positive integers, find whether a particular sum can be made using the array elements. There were Q queries, Q<=10^5.
How is this problem supposed to be solved?
Problem Link : https://www.hackerrank.com/contests/csindia14-er1/challenges/mice-v2 Hey Can you give a rough sketch on how to approach for problem Mice v2.?
Mice V2 editorial is here have a look.
Check out the editorial for fill the tank.
Create segment tree, then traverse it !?
The editorial was released for this problem, check it out.