| № | Пользователь | Рейтинг |
|---|---|---|
| 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 | 161 |
| 4 | TheScrasse | 160 |
| 5 | nor | 158 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 152 |
| 8 | orz | 146 |
| 9 | SecondThread | 145 |
| 9 | pajenegod | 145 |
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.