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

Автор Axelius, история, 9 лет назад, По-английски

Hello ,

I need help with problem 11235 — RMQ of UVA
Link : — https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=2176
Approach applied : I know that this question is of segment tree, and the values being in sorted order can further be used to calculate frequencies . The new frequency array should be pushed into segment tree , but after that I am lost . How would I then use the segment tree to calculate the answer , because I can't calculate answer for like (5,10) etc. Any help is appreciated !

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

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

Автор Axelius, 9 лет назад, По-английски

Hello , I would like some help regarding the problem UVA 616.This is a problem from math implementation section. I am at the moment checking for all possible values of group size ( till N) but its giving me TLE

The link :- https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=8&page=show_problem&problem=557

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

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

Автор Axelius, история, 9 лет назад, По-английски

Hello Guys

I need help with the problem 489C. I have started learning Dp and am trying to solve question with dp tag starting from most solved. So it would be helpful if you could describe in detail. Thanks in advance


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

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

Автор Axelius, история, 9 лет назад, По-английски

Hello guys , ============

Firstly I would like to wish you all Happy New Year.

I am facing some problem in this question

https://uva.onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=606

I would really request if some one could provide me some tips on the question.

My code that got WA is this

https://ideone.com/LiUclc

Thanks for the help in advance !

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

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

Автор Axelius, история, 9 лет назад, По-английски

Hello All , I have been here for quite some time and have been participating in contests too.But i always end up solving max 2 or 1 or none in Codeforces Div 2.I don't have quite the exposure as to how to get better in these competitions and improve my knowledge in algorithms etc.I am trying my best to read the editorials and the terms they use like trees etc.But i am not getting the grip on that. If any of you could help me in suggesting the resources I would be very glad. Thanks!

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

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