{{Problem C :- Barcode}}{{Codeforces Round 139 DIV 2}}

Правка en1, от sameer_hack, 2018-09-02 12:42:43

I am trying to solve this problem and I am not able to understand the editorial that why
dp[0][i]=min(dp[1][i-a]+sum-of-whites(i-a+1,i))
dp[1][i]=min(dp[0][i-a]+sum-of-blacks(i-a+1,i))
where a belongs to [x,y]
Editorial Link :- Editorial
Question Link :- Question

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский sameer_hack 2018-09-02 12:42:43 439 Initial revision (published)