DP Workaround

Revision en2, by AnasAbbas, 2018-02-14 21:49:40

hello codeforces

this problem 917A - The Monster has only a greedy solution which is well explained in the editorial

however i want to introduce a Dynamic programming solution

O(N^4) DP solution : 34679276

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en12 English AnasAbbas 2018-02-14 23:25:24 4 (published)
en11 English AnasAbbas 2018-02-14 23:23:03 6
en10 English AnasAbbas 2018-02-14 23:20:24 20
en9 English AnasAbbas 2018-02-14 23:17:47 32
en8 English AnasAbbas 2018-02-14 23:14:46 6 Tiny change: 'd bracket complexity' -> 'd bracket `\n\n`complexity'
en7 English AnasAbbas 2018-02-14 23:13:49 3 Tiny change: 'd bracket ---complexity' -> 'd bracket complexity'
en6 English AnasAbbas 2018-02-14 23:12:51 90
en5 English AnasAbbas 2018-02-14 23:07:57 2276
en4 English AnasAbbas 2018-02-14 21:50:47 22 Tiny change: '79276]\n\n\n\n' -> '79276]\n\n~~~~~\nint x,y\n~~~~~\n\n\n\n\n\n'
en3 English AnasAbbas 2018-02-14 21:50:17 29 Tiny change: '79276]\n\n\n\n' -> '79276]\n\n~~~~~\nint x,y\n~~~~~\n\n\n\n\n\n'
en2 English AnasAbbas 2018-02-14 21:49:40 21
en1 English AnasAbbas 2018-02-14 21:46:53 265 Initial revision (saved to drafts)