Codeforces Round 1133 (Div. 1, Div. 2) is coming soon! Register here. ×

samsidx's blog

Spoj ASSIGN
By samsidx, 12 years ago, In English

http://www.spoj.com/problems/ASSIGN/ I did solve this problem using up-down approach with memoization, but memory required is 2^20. is there any memory efficient way or how to solve when value of N is increased?? The web resources are also of memory O(2^20)

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

»
12 years ago, hide # |
← Rev. 2  
Vote: I like it 0 Vote: I do not like it

It uses 4MB memory

UPD : I read it wrong. Ignore.

→ Reply