nike0good |Oier&ACMer | 熟能生巧

8222. Substrings Problem code: NSUBSTR You are given a string S which consists of 250000 lowercase latin letters at most. We define F(x) as the maximal number of times that some stri

1812. Longest Common Substring II Problem code: LCS2 A string is finite sequence of characters over a non-empty finite set Σ. In this problem, Σ is the set of lowercase letters.

1811. Longest Common Substring Problem code: LCS A string is finite sequence of characters over a non-empty finite set Σ. In this problem, Σ is the set of lowercase letters. Su

MZL's Circle Zhou Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 236    Accepted Submission(s): 80 Problem Description MZL's Circle

Lexicographical Substring Search Glass Beads str2int AB String New Distinct Substrings Boring countingLexicographical Substring Search给一个字符串，求第k大子串，经典题#include<cstdio> #include<cstring> #include<cstdli

A string string string判断一个字符串恰出现k次的子串个数。 建立SAM，对每个节点统计出现次数cnticnt_i，先对字符串的n个后缀的cnti+=1cnt_i+=1，然后将每个节点的值更新父节点。#include<bits/stdc++.h> using namespace std; #define For(i,n) for(int i=1;i<=n;i++) #defi

给一个字符串t和t的n个子串，2人轮流操作， 每次选一个子串，在后面添加一个字符，放回去，要求添加后字符串仍是t的子串。 无法操作者输，问谁赢。SAM建图+sg#include<cstdio> #include<cstring> #include<cstdlib> #include<algorithm> #include<functional> #include<iostream> #inclu