摘要: 题目链接:https://www.luogu.org/problemnew/show/P1462 记住HP=0也叫死。 include include include include include using namespace std; const int maxn = 5000001; con 阅读全文
posted @ 2018-06-26 21:44 Misaka_Azusa 阅读(154) 评论(0) 推荐(0) 编辑
摘要: 题目链接:https://www.luogu.org/problemnew/show/P3808 include include include include include using namespace std; const int maxn = 1000010; int n, trie[ma 阅读全文
posted @ 2018-06-26 20:37 Misaka_Azusa 阅读(147) 评论(0) 推荐(0) 编辑
摘要: $Scapegoat$_$Tree$ ——(替罪羊树) ——识替罪羊树之算法乃吾生之幸也! $First$.引子: 知乎上面有个问题问最优雅的算法是什么,我觉得 暴力即是优雅。 当然这里说的暴力并不是指那种不加以思考的无脑的暴力,而是说用繁琐而技巧性的工作可以实现的事,我用看似简单的思想和方法,也可 阅读全文
posted @ 2018-06-26 11:47 Misaka_Azusa 阅读(523) 评论(0) 推荐(0) 编辑
Live2D