Advertisement
Guest User

Untitled

a guest
Feb 25th, 2020
85
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.37 KB | None | 0 0
  1. int maxLength = 1, bestEnd = 0;
  2. DP[0] = 1;
  3. prev[0] = -1;
  4.  
  5. for (int i = 1; i < N; i++)
  6. {
  7. DP[i] = 1;
  8. prev[i] = -1;
  9.  
  10. for (int j = i - 1; j >= 0; j--)
  11. if (DP[j] + 1 > DP[i] && array[j] < array[i])
  12. {
  13. DP[i] = DP[j] + 1;
  14. prev[i] = j;
  15. }
  16.  
  17. if (DP[i] > maxLength)
  18. {
  19. bestEnd = i;
  20. maxLength = DP[i];
  21. }
  22. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement