Hello Codeforces, i have tried to understand Edit Distance Dynamic Programming classical problem and i tried few tutorials through the internet and i couldn't understand the concept. can any one clarify it to me in very simple way ?
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3993 |
2 | jiangly | 3743 |
3 | orzdevinwang | 3707 |
4 | Radewoosh | 3627 |
5 | jqdai0815 | 3620 |
6 | Benq | 3564 |
7 | Kevin114514 | 3443 |
8 | ksun48 | 3434 |
9 | Rewinding | 3397 |
10 | Um_nik | 3396 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 156 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
Hello Codeforces, i have tried to understand Edit Distance Dynamic Programming classical problem and i tried few tutorials through the internet and i couldn't understand the concept. can any one clarify it to me in very simple way ?
Название |
---|
State with index x, y on table: minimum number of edits required to convert prefix of first string with legth x into prefix of second string with legth y;
Transitions: Possibles operations;
Or try it: http://bfy.tw/6TFq