Can anyone give a solution sketch for this problem? I've been stuck on it for a while and cannot find a solution online. Thanks!
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | awoo | 163 |
2 | maomao90 | 160 |
3 | adamant | 159 |
4 | maroonrk | 152 |
5 | -is-this-fft- | 150 |
6 | atcoder_official | 148 |
6 | SecondThread | 148 |
8 | nor | 147 |
9 | TheScrasse | 146 |
10 | Petr | 144 |
Can anyone give a solution sketch for this problem? I've been stuck on it for a while and cannot find a solution online. Thanks!
Given a string a and b that consist of exactly the same characters, determine the minimum “cuts” required on string a such that it is possible to rearrange the segments of string a to match string b,
For instance, if a = “xxyyz” and b = “zxyxy”, the minimum cuts required on string a is 3
Illustration: x | xy | y | z --> z-xy-x-y
Constraints: |a| = |b| <= 20.
Time limit: 1 second
Название |
---|