unbelievable02's blog

By unbelievable02, history, 4 years ago, In English

Hello Codeforces!!!

Izho 2018 have been finished. I wish everyone the best awards. Let's solve the problems together and compensate our mistakes on olympiad.

Read more »

 
 
 
 
  • Vote: I like it
  • +2
  • Vote: I do not like it

By unbelievable02, history, 4 years ago, In English

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.

Read more »

 
 
 
 
  • Vote: I like it
  • +3
  • Vote: I do not like it