Difference between revisions of "2019 Multi-University,HDU Day 5"
Jump to navigation
Jump to search
Xiejiadong (talk | contribs) (Created page with "== Problem A == Unsolved. == Problem B == Unsolved. (-9) == Problem C == Unsolved. == Problem D == Solved by Xiejiadong. 01:33:31 (+1) == Problem E == Solved by Weave...") |
Xiejiadong (talk | contribs) |
||
| Line 22: | Line 22: | ||
Solved by Xiejiadong. 00:26:00 (+) | Solved by Xiejiadong. 00:26:00 (+) | ||
| + | |||
| + | 题意：给一个字符串，求暴力做 $lcp$ 的时候的比较次数。 | ||
| + | |||
| + | 题意：大概看一下就能发现了： | ||
| + | |||
| + | * 如果 $lcp$ 是短串的全部，比较次数就是短串长度； | ||
| + | |||
| + | * 否则，比较次数就是 $lcp +1$ ； | ||
| + | |||
| + | 于是，问题就变成求所有后缀和全串的 $lcp$ ，抄个 exkmp 就过了。 | ||
== Problem G == | == Problem G == | ||
Revision as of 10:55, 5 August 2019
Problem A
Unsolved.
Problem B
Unsolved. (-9)
Problem C
Unsolved.
Problem D
Solved by Xiejiadong. 01:33:31 (+1)
Problem E
Solved by Weaver_zhu. 00:57:42 (+)
Problem F
Solved by Xiejiadong. 00:26:00 (+)
题意：给一个字符串，求暴力做 $lcp$ 的时候的比较次数。
题意：大概看一下就能发现了：
- 如果 $lcp$ 是短串的全部，比较次数就是短串长度；
- 否则，比较次数就是 $lcp +1$ ；
于是，问题就变成求所有后缀和全串的 $lcp$ ，抄个 exkmp 就过了。
Problem G
Solved by Kilo_5723. 00:51:52 (+)
Problem H
Solved by Kilo_5723. 03:04:27 (+5)
Problem I
Unsolved.
Problem J
Unsolved.