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...
# | User | Rating |
---|---|---|
1 | ecnerwala | 3650 |
2 | Benq | 3582 |
3 | Geothermal | 3570 |
3 | orzdevinwang | 3570 |
5 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3532 |
8 | Radewoosh | 3522 |
9 | Um_nik | 3483 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 163 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 146 |
8 | orz | 146 |
10 | pajenegod | 145 |
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...
Name |
---|
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.