Пожалуйста, подпишитесь на официальный канал Codeforces в Telegram по ссылке https://t.me/codeforces_official. ×

Блог пользователя NVGU

Автор NVGU, история, 11 месяцев назад, По-английски

Today I read the following problem that makes all elements in a sequence the same, using the minimum number of steps. Where each step increments or decrements an element by a constant integer d. And I know the minimum number of steps is the number of steps that make all elements the median of all elements. But I don't know how to prove it. please can someone help me prove it. Thanks for taking the time to read this blog,

Полный текст и комментарии »

  • Проголосовать: нравится
  • +5
  • Проголосовать: не нравится

Автор NVGU, история, 12 месяцев назад, По-английски

Hello everyone!!!

Have a good day.

I want to learn sweep line but can't find any basic knowledge related to it. I really want to learn sweep line, please send me some websites or some videos about sweep line.

Please give me some prolems related to sweep line (from easy to difficult).

Thank you to everyone who took the time to read this status!

If there are any grammatical mistakes, please forgive me.

If the post is not polite, I apologize

Полный текст и комментарии »

  • Проголосовать: нравится
  • +2
  • Проголосовать: не нравится

Автор NVGU, 13 месяцев назад, По-английски

Hello everyone, have a nice day!

At school, I have a problem that is: Given a sequence A consisting of N elements and the task is to remove some elements so that the average of all the remaining elements is the largest. I know the result is the largest value in that sequence, but I don't know how to prove it's the right result.

Please, can someone prove that help me understand?

Thank you to everyone who took the time to read this status!

If there are any grammatical mistakes, please forgive me.

Полный текст и комментарии »

  • Проголосовать: нравится
  • +3
  • Проголосовать: не нравится