how to prove that a dp solution state is wrong in general?

Правка en2, от WinstonWolf, 2017-12-31 02:33:07

I'm stuck in this problem 225C - Barcode

Here is my solution 33821210

I tried to calculate the array dp[current_column][width_of_current_group][hash_or_dot], and after i read the tutorial saying that i should calculate only dp[current_column][hash_or_dot] i didn't figure out why my solution was wrong.

I think they are the same, can't see any difference... can somebody help?

Теги #dynamic-programming

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский WinstonWolf 2017-12-31 02:33:07 8 Tiny change: 'ission:33807563]\n\nI tri' -> 'ission:33821210]\n\nI tri'
en1 Английский WinstonWolf 2017-12-31 02:31:45 461 Initial revision (published)