You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
vector<int> d1(n);
for (int i = 0, l = 0, r = -1; i < n; i++) {
int k = (i > r) ? 1 : min(d1[l + r - i], r - i + 1); // 这行while (0 <= i - k && i + k < n && s[i - k] == s[i + k]) {
k++;
}
d1[i] = k--;
if (i + k > r) {
l = i - k;
r = i + k;
}
}
而 docs/string/manacher.md 的代码和原文有一些偏差 int k = (i > r) ? 1 : min(d1[l + r - i], r - i);
请选择:
我正在访问这个页面
https://github.com/OI-wiki/OI-wiki/tree/master/docs/string/manacher.md
我发现页面有这样的问题
原文(英文翻译)中对d1[]计算的代码如下
而 docs/string/manacher.md 的代码和原文有一些偏差
int k = (i > r) ? 1 : min(d1[l + r - i], r - i);
可能是这个偏差让自己写某裸题时WA了
请协助勘误, 谢谢.
以及OI-Wiki/i18n那边可以全文引用英文翻译?(狗头)The text was updated successfully, but these errors were encountered: