世界很大

Power StringsTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 36063 Accepted: 14902DescriptionGiven two strings a and b we define a*b to be their concatena

题目链接：poj 1743 Musical ThemeMusical Theme Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 24442 Accepted: 8233 DescriptionA musical melody is represented as a sequence of

题目链接：poj 3261 Milk PatternsMilk Patterns Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 13092 Accepted: 5825 Case Time Limit: 2000MS DescriptionFarmer John has noticed

题目链接：SPOJ DISUBSTR - Distinct SubstringsDISUBSTR - Distinct Substrings no tags Given a string, we need to find the total number of its distinct substrings.InputT- number of test cases. TEach

倍增：时间复杂度O(nlogn)，数组均开n即可。int cmp(int *r, int a, int b, int l) { return (r[a] == r[b]) && (r[a+l] == r[b+l]);}int wa[MAXN], wb[MAXN], ws[MAXN], wv[MAXN];int R[MAXN];//下标0->n-1 存储的是1->n之间的数i

题目链接：hdoj 5442 Favorite Donut近来去预习了一发KMP，发现一剩题。题意：给定一个长度为n的首尾相接的字符串，你可以顺时针找到n个串，逆时针找到n个串。问你所有串中字典序最大的串，若有多个则输出起点最小的，若依然有多少个，优先输出顺时针。正反跑一次最大表示法，反着的就先找到那个字典序最大的串，跑一次KMP，找到最近的位置。然后比较即可。其实可以用后缀数组，