后缀数组
Mercury_Lc
宁愿笑着哭
展开
-
A * B Problem Plus【HDU 1402】 【FFT求高精度乘法】
转自kuangbin模板、 #include <stdio.h> #include <string.h> #include <iostream> #include <algorithm> #include <math.h> #include <queue> #include <stack> #include转载 2019-01-21 16:27:17 · 298 阅读 · 0 评论 -
New Distinct Substrings 【 后缀数组 模板题 】
New Distinct Substrings 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...原创 2019-02-17 14:26:08 · 203 阅读 · 0 评论