摘要： 惊闻省督查组前来检查两个月， 会查IP的访问。我也不知道这样写有没有用， 可能比较多的话他就不查了吧 我的默认浏览器是360chrome cpp include include include include include include define ll long long define mm 阅读全文

摘要： ```cpp / 动态求right集合的大小 LCT维护parent树即可 注意 由于树是有向的不会换根并且每次操作单一， 于是不需要维护子树和（写起来很麻烦） 直接打标记修改即可 / include include include include include define ll long lo 阅读全文

摘要： ```cpp / 字符串长度较小， 可以离线或者直接与处理所有区间的答案 动态加入点的时候， 因为对于其他点的parent构造要么没有影响， 要么就是在两个节点之间塞入一个点， 对于minmax的贡献没有改变 所以只统计这个点的贡献就好了 / include include include incl 阅读全文

摘要： ```cpp / 求right集合大小 然后后缀最大值 / include include include include include define ll long long define M 600010 define mmp make_pair using namespace std; in 阅读全文

摘要： 能匹配上子串的节点对它的所有parent都有贡献 在树上转移即可 cpp include include include include include define ll long long define M 200010 using namespace std; int read() { int 阅读全文

摘要： ```cpp / 贪心来选择， 如果能找到比当前小的， 就用最小的来更新当前的 优先队列即可 / include include include include include define ll long long define mmp make_pair define M using names 阅读全文

摘要： ```cpp / 统计每个节点的max和min， 然后求和即可 min = max[fa] + 1 / include include include include include define ll long long define M 6010 define mmp make_pair usi 阅读全文

摘要： 你没有看错，菜鸡退役前刚学后缀自动机 cpp include include include include include define ll long long define M 2000010 define mmp make_pair using namespace std; int read 阅读全文

摘要： ```cpp / dp维护整体的概率， 每次相当于回退一格然后重新dp一格 / include include include include include define ll long long define M 202 define mmp make_pair using namespace 阅读全文

摘要： ```cpp #include #include #include #include #include using namespace std; #define problem "a" //输出文件名 #define prename "a" //更改之前的文件名 char ak[1000]; int cases = 10;//数据组数 int mode = 1;//造数据 / 重... 阅读全文