SPOJ New Distinct Substrings
来源:互联网 发布:闲鱼上面的淘宝优惠券 编辑:程序博客网 时间:2024/05/18 15:06
D - New Distinct Substrings
Time Limit:280MS Memory Limit:1572864KB 64bit IO Format:%lld & %lluDescription
Given a string, we need to find the total number of its distinct substrings.
Input
T- number of test cases. T<=20; Each test case consists of one string, whose length is <= 50000
Output
For each test case output one number saying the number of distinct substrings.
Example
Input:2CCCCCABABAOutput:59
#include <cstdio>#include <cstring>const int N = 50010;char str[N];int sa[N], wa[N], wb[N], ws[N], wv[N];bool Cmp(int *r, int a, int b, int l) {return r[a] == r[b] && r[a + l] == r[b + l];}void DA(int n, int m) {int i, j, p, *x = wa, *y = wb, *t;for (i = 0; i < m; ++i) ws[i] = 0;for (i = 0; i < n; ++i) ws[x[i] = str[i]]++;for (i = 1; i < m; ++i) ws[i] += ws[i - 1];for (i = n - 1; i >= 0; --i) sa[--ws[x[i]]] = i;for (j = p = 1; p < n; m = p, j <<= 1) {for (p = 0, i = n - j; i < n; ++i) y[p++] = i;for (i = 0; i < n; ++i) if (sa[i] >= j) y[p++] = sa[i] - j;for (i = 0; i < n; ++i) wv[i] = x[y[i]];for (i = 0; i < m; ++i) ws[i] = 0;for (i = 0; i < n; ++i) ws[wv[i]]++;for (i = 1; i < m; ++i) ws[i] += ws[i - 1];for (i = n - 1; i >= 0; --i) sa[--ws[wv[i]]] = y[i];t = x, x = y, y = t;for (p = i = 1, x[sa[0]] = 0; i < n; ++i)x[sa[i]] = Cmp(y, sa[i - 1], sa[i], j) ? p - 1 : p++;}}int height[N], rank[N];void calheight(int n) {int i, j, k = 0;for (i = 1; i <= n; ++i) rank[sa[i]] = i;for (i = 0; i < n; height[rank[i++]] = k)for (k ? --k : 0, j = sa[rank[i] - 1]; str[i + k] == str[j + k]; ++k);}int main() {int T;scanf("%d", &T);while (T--) {int ans = 0;scanf("%s", str);int len = strlen(str);DA(len + 1, 256);calheight(len);for (int i = 1; i <= len; ++i)ans += (len - sa[i] - height[i]);printf("%d\n", ans);}return 0;}
0 0
- SPOJ New Distinct Substrings
- spoj 705. New Distinct Substrings
- SPOJ 705 New Distinct Substrings
- [SPOJ 705] New Distinct Substrings
- SPOJ SUBST1 New Distinct Substrings
- spoj 694 Distinct Substrings 705 New Distinct Substrings
- SPOJ 694. Distinct Substrings,705. New Distinct Substrings(后缀数组)
- spoj 694 705. New Distinct Substrings
- spoj -705 New Distinct Substrings--后缀数组
- SPOJ 705 New Distinct Substrings (后缀数组)
- SPOJ 705 New Distinct Substrings 后缀数组
- 【SPOJ-SUBST1】New Distinct Substrings【后缀数组】
- SPOJ 705 New Distinct Substrings 后缀数组
- SPOJ New Distinct Substrings(后缀数组)
- SPOJ 694 Distinct Substrings + SPOJ 705 New Distinct Substrings (可重叠不相同子串个数)
- SPOJ - Distinct Substrings / SPOJ - New Distinct Substrings(后缀数组 - 不相同子串个数)
- SPOJ 694 Distinct Substrings
- 694. Distinct Substrings SPOJ
- HDU5373 The shortest problem 数学水题
- 关于Visual Studio 2010与64位系统的问题
- 架构师速成8.4-分库分表的关键点
- Android源码——小苏闹钟
- 读写锁的实现
- SPOJ New Distinct Substrings
- Python 之 cPickle 实现 文件存取
- U_Ting
- 查询结果遍历处理
- iOS连载第13篇
- BZOJ 3514 Codechef MARCH14 GERALD07加强版 LCT+主席树
- 微软公司等数据结构+算法面试100题(第1-100题)全部出炉
- github入门
- Windows下 Nginx+tomcat+memcached配置