2018年4月13日
FZU - 2109 Mountain Number 数位dp
摘要： Mountain Number One integer number x is called "Mountain Number" if: (1) x>0 and x is an integer; (2) Assume x=a[0]a[1]...a[len-2]a[len-1](0≤a[i]≤9, a 阅读全文
posted @ 2018-04-13 18:16 yzm10 阅读(229) 评论(0) 推荐(0)
DP专题
摘要： 最全DP总结 https://blog.csdn.net/cc_again/article/details/25866971 ACM题集 https://blog.csdn.net/liuqiyao_01/article/details/9079611 数位dp模板讲解 https://blog.c 阅读全文
posted @ 2018-04-13 15:57 yzm10 阅读(236) 评论(0) 推荐(0)
HDU - 1150 POJ - 1325 Machine Schedule 匈牙利算法（最小点覆盖）
摘要： Machine Schedule As we all know, machine scheduling is a very classical problem in computer science and has been studied for a very long history. Sche 阅读全文
posted @ 2018-04-13 09:23 yzm10 阅读(185) 评论(0) 推荐(0)