摘要: omo省选前夜… I'm Crawling Back to U... 若干坑点: solve(x)是指小于x的windy数数量… 所以答案应是solve(b+1) solve(a) 还有数组大小问题… B了狗了… // BZOJ 1026 数位DP include include include u 阅读全文
posted @ 2016-04-15 21:55 Armeria 阅读(147) 评论(0) 推荐(0) 编辑