Difference between taking cumulative maximum VS individual maximum ( SPOJ : ABCPATH)

Revision en1, by abusomani, 2018-11-10 16:10:45

I was trying to solve a very simple and yet conceptual problem on SPOJ called ( ABCPATH ).

To describe the problem in a nutshell :

We are given

Tags #dynamic-programming, #spoj, longest path, maximum, 2d-dp, #dp

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en6 English abusomani 2018-11-10 16:53:24 0 Added links to the solution (published)
en5 English abusomani 2018-11-10 16:52:41 180 Tiny change: '/FnY4vt)\nLink to ' -> '/FnY4vt)\n\nLink to ' (saved to drafts)
en4 English abusomani 2018-11-10 16:42:52 130 (published)
en3 English abusomani 2018-11-10 16:38:17 985 Tiny change: 'aders) :\n\n`\n ' -> 'aders) :\n`return 0;`\n\n`\n '
en2 English abusomani 2018-11-10 16:20:05 2719
en1 English abusomani 2018-11-10 16:10:45 275 Initial revision (saved to drafts)