can anyone help me to understand the solution of (http://mirror.codeforces.com/problemset/problem/682/D) problem.It's like longest common sub-sequence but there is a extra condition.I am trying to understand the recurrence relation.
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
can anyone help me to understand the solution of (http://mirror.codeforces.com/problemset/problem/682/D) problem.It's like longest common sub-sequence but there is a extra condition.I am trying to understand the recurrence relation.
problem C — Watto and Mechanism.... can anyone explain why i am getting TLE? my code is given below: 9867828.i think my code execute worst query in 3.6*10^11.can anyone tell me how can reduce this operation number?
Название |
---|