#include

using namespace std;

/* * Complete the 'AllLongestPalindromeSubseqs' function below. * * The function is expected to return a STRING_ARRAY. * The function accepts STRING s as parameter. */

vector dp[1001][1001];

vector AllLongestPalindromeSubseqs(string s) { }

int main() { ofstream fout(getenv("OUTPUT_PATH"));

string s; getline(cin, s);

vector result = AllLongestPalindromeSubseqs(s);

for (size_t i = 0; i

if (i != result.size() - 1) { fout

fout

fout.close();

return 0; }

All-longest-palindrome-subsequences Given a string s, find all longest palindromic subsequences in s. Return the list of subsequences which being sorted in lexicographic order. You may assume that the maximum length of s is 1000. Example 1: input: "bacdab" output: "bacab badab" Example 2: input: "bcdcdb" output: "bcdcb","bdcdb" Input Format string Constraints length of string s