IZHO 2009 problem.

Revision en2, by unbelievable02, 2017-12-13 08:06:08

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.

Tags izho 2009, need help, #geometry


  Rev. Lang. By When Δ Comment
en2 English unbelievable02 2017-12-13 08:06:08 1 Tiny change: 'number k(k=1e9), you' -> 'number k(k<=1e9), you'
en1 English unbelievable02 2017-12-13 08:04:49 340 Initial revision (published)