【Code Forces 321E】【线段树+字符串哈希】Kefa and Watch 字符串修改循环节判定

最新推荐文章于 2024-08-19 01:59:22 发布

snowy_smile

最新推荐文章于 2024-08-19 01:59:22 发布

阅读量1.1k

点赞数 1

CC 4.0 BY-SA版权

分类专栏：题库-CF CodeForces 字符串算法-字符串哈希数据结构-线段树

本文链接：https://blog.youkuaiyun.com/snowy_smile/article/details/48677011

#include<stdio.h>
#include<iostream>
#include<string.h>
#include<ctype.h>
#include<math.h>
#include<map>
#include<set>
#include<vector>
#include<queue>
#include<functional>
#include<string>
#include<algorithm>
#include<time.h>
#include<bitset>
void fre(){freopen("c://test//input.in","r",stdin);freopen("c://test//output.out","w",stdout);}
#define MS(x,y) memset(x,y,sizeof(x))
#define MC(x,y) memcpy(x,y,sizeof(x))
#define MP(x,y) make_pair(x,y)
#define ls o<<1
#define rs o<<1|1
typedef long long LL;
typedef unsigned long long UL;
typedef unsigned int UI;
template <class T>