| # | User | Rating |
|---|---|---|
| 1 | ecnerwala | 3648 |
| 2 | Benq | 3580 |
| 3 | orzdevinwang | 3570 |
| 4 | cnnfls_csy | 3569 |
| 5 | Geothermal | 3568 |
| 6 | tourist | 3565 |
| 7 | maroonrk | 3530 |
| 8 | Radewoosh | 3520 |
| 9 | Um_nik | 3481 |
| 10 | jiangly | 3467 |
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 2 | adamant | 164 |
| 4 | TheScrasse | 159 |
| 4 | nor | 159 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 150 |
| 8 | SecondThread | 147 |
| 9 | orz | 146 |
| 10 | pajenegod | 145 |
IZHO 2009 problem.
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.
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en2 |
|
unbelievable02 | 2017-12-13 08:06:08 | 1 | Tiny change: 'number k(k=1e9), you' -> 'number k(k<=1e9), you' | |
| en1 |
|
unbelievable02 | 2017-12-13 08:04:49 | 340 | Initial revision (published) |
