2019年11月18日
[Codeforces 1253E] Antenna Coverage
摘要： Dynamic programming solution State: dp[i]: the minimum cost to cover all positions from[0, i]. (left shift by 1 to get 0 index) // if position i is al 阅读全文
posted @ 2019-11-18 08:53 Review->Improve 阅读(499) 评论(0) 推荐(0) 编辑