- 博客(2)
- 收藏
- 关注
RSS订阅原创 PAT 1049. Counting Ones (30)（数位dp（记忆化搜索））
The task is simple: given any positive integer N, you are supposed to count the total number of 1’s in the decimal form of the integers from 1 to N. For example, given N being 12, there are five 1’s in
2017-11-26 21:55:04
302
原创 poj 3661（区间dp）
The ultimate distance Bessie runs, though, depends on her ‘exhaustion factor’, which starts at 0. When she chooses to run in minute i, she will run exactly a distance of Di (1 ≤ Di ≤ 1,000) and her exh
2017-11-01 22:25:37
222
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人