| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | ecnerwala | 3649 |
| 2 | Benq | 3581 |
| 3 | orzdevinwang | 3570 |
| 4 | Geothermal | 3569 |
| 4 | cnnfls_csy | 3569 |
| 6 | tourist | 3565 |
| 7 | maroonrk | 3531 |
| 8 | Radewoosh | 3521 |
| 9 | Um_nik | 3482 |
| 10 | jiangly | 3468 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 3 | adamant | 161 |
| 4 | TheScrasse | 159 |
| 5 | nor | 158 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 152 |
| 8 | SecondThread | 147 |
| 9 | orz | 146 |
| 10 | pajenegod | 145 |
Hello Codeforces!
I need help on IZHO 2009 E-problem. How to solve it?
Short description :
Given number n and two arrays, W[1...n], S[1...n].(n <= 1e5). And q queries. For each query given number k(k<=1e9), you must find pos, what d(pos, k) is maximum. Where d(x, k) = W[x] + k * S[x].
P.S sorry for my English.
https://wcipeg.com/wiki/Convex_hull_trick
I understand what we will use this, but how?
Just add slopes like (S[x],W[x]). Then for every query you can find a answer with binary search or just sort the queries to use pointer technique.
Thank you