Question about memory reduction in Dynamic Programming problem

Revision en2, by Bekh, 2019-09-24 20:52:21

Hello,

I was trying to solve 383E - Vowels. Using the technique described here: https://codeforces.net/blog/entry/45223

I managed to get AC here: 61233188 using regular memory reduction (Reducing one of the dimensions to the size of 2).
I don't understand how it can be reduced to one-dimensional like this: 61233599.

Here is an image (with my amazing paint skills :P) to demonstrate my understanding of the dp dependencies in this problem: Untitled.png

I can't see how these updates are done in the solution with only one dimension.

Any help would be appreciated.
Thanks.

Tags #dp, #dynamic programing, memory reduction

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English Bekh 2019-09-24 20:52:21 289 Tiny change: 'roblem:![ ](https://' -> 'roblem:![ ss](https://' (published)
en1 English Bekh 2019-09-24 20:41:14 536 Initial revision (saved to drafts)