摘要: 字典树 https://vjudge.net/problem/UVALive-3942/origin 字典树维护dp转移 记忆化搜索. const int maxn = 2e6 + 7; const int mod = 20071027; int n, t, m; int dp[maxn], nex 阅读全文
posted @ 2021-07-29 22:02 naymi 阅读(31) 评论(0) 推荐(0)