Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

PRINT THE LCS (Dynamic programming) #209

Open
jacker0031 opened this issue Oct 16, 2020 · 1 comment
Open

PRINT THE LCS (Dynamic programming) #209

jacker0031 opened this issue Oct 16, 2020 · 1 comment

Comments

@jacker0031
Copy link

In this problem when i used a[i][j]=1+a[i-1][j-1] use because when we consider i the element or j th element than that is taken in LCS but my solution on passed all solution in atcoder dp contest link is provided below
https://atcoder.jp/contests/dp/tasks/dp_f
@srajantiwari srajantiwari mentioned this issue Oct 18, 2020
Merged
4 tasks
@srajantiwari
Copy link
Contributor

@larissalages Added the solution to the issue with all guidelines in check. Please review PR #272
Thank You!

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
2 participants
@srajantiwari @jacker0031