| # | User | Rating |
|---|---|---|
| 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 |
| # | User | Contrib. |
|---|---|---|
| 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 |
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) |
