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 | jiangly | 3810 |
| 2 | Benq | 3676 |
| 3 | Kevin114514 | 3655 |
| 4 | maroonrk | 3463 |
| 5 | strapple | 3447 |
| 6 | Um_nik | 3387 |
| 7 | heuristica | 3322 |
| 8 | turmax | 3317 |
| 9 | tourist | 3307 |
| 10 | jiangbowen | 3291 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 156 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | Um_nik | 142 |
| 5 | Errichto | 139 |
| 6 | adamant | 137 |
| 7 | AmShZ | 136 |
| 8 | BledDest | 132 |
| 9 | maroonrk | 131 |
| 10 | qwexd | 129 |
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.