【字符串】【Trie】lcp 题解
求∑0<i<n∑i<j≤nlcp(si,sj)\sum_{0<i<n}\sum_{i<j≤n}lcp(si,sj) 建立Trie树暴力跑一下,点上用组合数计算结果#include <iostream>#include <sstream>#include <cstdio>#include <cstdlib>#include <ctime>#include <cmath>#include
原创
2017-10-06 20:25:19 ·
688 阅读 ·
0 评论