FineLine's blog

By FineLine, history, 8 years ago, In English

Hello Everyone ,I am trying to solve this problem for some time now.I could not find an explanation in English for it anywhere . The question is related to DP (on trees) . In Brief the problem asks you to find the minimum number of edges to be removed to isolate a subtree of size p .The original problem statement can be seen here.Thanks in advance :)

Full text and comments »

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

By FineLine, history, 8 years ago, In English

HI Everyone out there,Hope this post find you in best of your spirits.Yesterday I was attempting this SPOJ Problem here.I got the idea instantly that the state of dp will be defined as dp[node][flag] where flag denotes whether ticket has to be bought for this node or not.But I am having a hard time implementing it... Can somebody please help me in its implementation.Thanks and Have a nice day.

Full text and comments »

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

By FineLine, history, 8 years ago, In English

Hi everyone,I have been trying this question SPOJ K-QUERYfor 2 days now.After unsuccessful attempts to come up with logic,I finally referred Blogs available online.But I am neither getting head nor tail of the logic. Can someone please tell me the formation of fenwick/segment tree that is used(especially the technique used).It will be a great help.Please! Thanks in advance.

Full text and comments »

  • Vote: I like it
  • -9
  • Vote: I do not like it

By FineLine, history, 8 years ago, In English

__Hi everyone.I was trying to practice DP and then I encountered this question 161D - Distance in Tree.I have got the basic idea But I do not know how the editorialist gave the second recurrence relation. Can anyone please spare his precious time and help me regarding the same. Regards and Thanks in advance.

Full text and comments »

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

By FineLine, history, 8 years ago, In English

Hi everyone I have been trying to solve this problem for a lot of time Timus 1846()..I know that this is a problem of segment tree .Can anyone please help me regarding the same. REGARDS..

Full text and comments »

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

By FineLine, history, 9 years ago, In English

Hello Codeforces members.. I am a newbie in competitive programming but I have developed bad habit of seeing the solutions in 1-2 days... I really try hard during those 1-2 days devoting 7-8 hours on the day... What should I do.....????????????????? Another habit is to copy-paste the difficult code . Can anyone please help me regarding the same .It will be a great help. Regards.

Full text and comments »

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