The Dynamic Programming Pattern

a

b

x

c

d = a + 2 if s = t

= a - 1 otherwise

h = c - 1

v = b - 1

x = max(d, h, v)

s

t

Previous slide

Next slide

Back to first slide

View graphic version