Implement a dynamic programming solution to find the longest palindromic subsequence in a string provided by the user.

Implement a dynamic programming solution to find the longest palindromic subsequence in a string provided by the user. (Preferably using C++ / Java / C# / Python) The output should display a longest palindrome, as well as provide the length. Allow the user to repeat the process with a new input string.