Solution for Timus 2016

Правка ru1, от andreyDagger, 2021-09-19 19:32:38

Hi Guys, Can anyone help me solve this problem?

https://acm.timus.ru/problem.aspx?space=1&num=2019&locale=en

I tried to solve it greedily. Also i tried to solve it using dynamic programming. I had dp[l][r] true if exists k such dp[l][k] is true and dp[k + 1][r] is true, but that works for O(n^3)

Теги timus

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
ru4 Русский andreyDagger 2021-09-19 19:37:34 2 (опубликовано)
ru3 Русский andreyDagger 2021-09-19 19:36:42 15
ru2 Русский andreyDagger 2021-09-19 19:35:28 159
ru1 Русский andreyDagger 2021-09-19 19:32:38 332 Первая редакция (сохранено в черновиках)