Secretary Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 1257   Accepted: 515 Description The basic condition of success of a political party, it is the good Election Programme. PSOS know about it, so they entrust the top secretary Juli…

学后缀数组后的一道裸题.先来讲讲收获,作为字符串初学者,后缀数组也是刚刚在学,所幸的是有一篇好的论文<后缀数组--处理字符串的有力工具>by 罗穗骞,里面非常详尽地介绍了有关后缀数组的概念,也就是sa[i]和rk[i]表示的是什么.理解了它们互为逆运算后就不难理解sa[rk[i]]=i rk[sa[i]]=i,所以知道其中一个就可以知道另外一个,然后学习了一下后缀数组中的倍增算法构建,虽然效率比不上线性的算法,但是胜在好理解,好写.当然大神的代码我是不怎么懂,我就翻阅了另一本书<挑战程序…

Secretary Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 992   Accepted: 408 Description The basic condition of success of a political party, it is the good Election Programme. PSOS know about it, so they entrust the top secretary Julie…

#include <iostream> #include <cstring> #include <string> #include <cstdio> using namespace std; int T, n, m, p, len, r[20005], c[20005], x[20005], y[20005], sa[20005]; int rank[20005], ans, hei[20005]; string s, t; void getSa(){ r[…