cpx17852033609的博客

It is well known that AekdyCoin is good at string problems as well as number theory problems. When given a string s, we can write down all the non-empty prefixes of this string. For example:  s: "abab...

思路:DP #include <bits/stdc++.h> using namespace std; const long long int mod=1e9+7; long long int dp[200100][10]; int main() { long long int n,l,r; scanf("%lld%lld%lld",&n,&...