Dwylkz

Longest Common SubstringTime Limit: 8000/4000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1453    Acce

Long Long Message Time Limit: 4000MS   Memory Limit: 131072K Total Submissions: 12008   Accepted: 4843 Case Time Limi

Concatenate the long string and itself. Then construct SuffixArray, rmq. Easy. #include #include #include #include using namespace std; const int N = 3e5+10; typedef long long LL; void sa_da(i

Longest Common Substring Time Limit: 8000/4000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 1453    Accepted Submission(s): 419 Problem Description Given two stri...

Long Long Message Time Limit: 4000MS   Memory Limit: 131072K Total Submissions: 12008   Accepted: 4843 Case Time Limit: 1000MS Description The little cat is majoring in physi...