2015年10月25日
BNU 13064 Dice (I) 前缀和优化DP
摘要： Dice (I)You haveNdices; each of them hasKfaces numbered from1toK. Now you have arranged theNdices in a line. You can rotate/flip any dice if you want.... 阅读全文
posted @ 2015-10-25 16:23 meekyan 阅读(284) 评论(0) 推荐(0)
HDU 5489 Difference of Clustering 图论
摘要： Difference of ClusteringProblem DescriptionGiven two clustering algorithms, the old and the new, you want to find the difference between their results... 阅读全文
posted @ 2015-10-25 15:25 meekyan 阅读(188) 评论(0) 推荐(0)