i solved "longest common subsequnce" problem....there the elements need not to be contiguous....but whn i saw a video on maximum subsequence sum....he said sequnce has to be contiguous.....
i am confused which one to follow....
pls clear...
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
i solved "longest common subsequnce" problem....there the elements need not to be contiguous....but whn i saw a video on maximum subsequence sum....he said sequnce has to be contiguous.....
i am confused which one to follow....
pls clear...
Название |
---|
When in doubt about a term, you can always use Google. For common terms, the first few links will provide the same right definition.
If you are interesting in dynamic programming try these videos this is a helpful playlist,it's all about dynamic programming :)
In some string problem, usually subsequence need not to be contiguous, substring need to be contiguous. Anyway, read the problem statement carefully, maybe statement has explained this.