摘要:
"CF 840 D" clf大佬告诉我,直接主席树是$n\times \log(n)$哒 这是为什么呢. 首先最多有5个叶子节点是出现次数大于等于$n\over 5$哒,然后上述叶子也可能不是叶子啊. 阅读全文
摘要:
```cpp include include include include include using namespace std; const int MAXL=1000000; char s1[MAXL+10],s2[MAXL+10]; int len1,len2; int nxt[MAXL+ 阅读全文