- When solving this problem: http://www.codechef.com/problems/MARCHA6, I got an issue, that is: Let 2 binary strings A and B. With every index i of string A, calculate the max matching of string starting from i and string B. For example:
- A= 1 0 1 1 0 0 1 1 1 0
- B= 0 1 1 1 0 1
- with i= 1 -> max matching= 0
- i= 2 -> max matching= 3 (it is '0 1 1')
- i= 3 -> max matching= 0
- i= 4 -> max matching= 0
- i= 5 -> max matching= 1 (it is '0')
- Could anyone tell me how to solve it in O(n)?
Thank you! Sorry for my poor English.
→ Обратите внимание
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3821 |
| 3 | Benq | 3736 |
| 4 | Radewoosh | 3631 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3388 |
| 10 | gamegame | 3386 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 164 |
| 1 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 161 |
| 5 | -is-this-fft- | 158 |
| 6 | awoo | 157 |
| 7 | adamant | 156 |
| 8 | TheScrasse | 154 |
| 8 | nor | 154 |
| 10 | Dominater069 | 153 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 10.11.2024 10:58:52 (j1).
Десктопная версия, переключиться на мобильную.
При поддержке
http://codeforces.me/blog/entry/3107
Oh, thanks a lot! This is what I need!
You didn't know about Z-algorithm before? Oo
How?
Z algorithm is not popular in Vietnam. We only know KMP