随笔分类 -  数据结构_倍增ST类

CF1175E Minimal Segment Cover
摘要：贪心，倍增优化n至log(n) #include<iostream> #include<cstdio> #define ri register int #define u int namespace opt { inline u in() { u x(0),f(1); char s(getchar( 阅读全文
posted @ 2019-11-08 16:28 pai_hoo 阅读(106) 评论(0) 推荐(0)