While perhaps not as efficient, I suggest looking for smaller palindromes and

working upwards from those. If we cannot find a sub-string palindrome of length n,

then there will not be one of length n+1 (because we can create a palindrome of

length n by eliminating a character from the larger palindrome).

std::string Text;

bool PDRMS = true;
int LENGTH = 1;

////////////////////[HEIGHT,WIDTH]///////////////////////
Matrix<bool> INDX [Text.length(),Text.length()+1] = false;

bool TEST_UPDATE(int Row_Indx){
string T1 = "";
for(int i = 1; i < INDX.WIDTH; i++){
if(INDX[Row_Indx,i]){T1 += Text[i];}
}

for(int j = 0; j < T1.length()/2; j++){
if(T1[0] != T1[T1.length()-(T1+1)]){
return false;
}
}

return true;
}

bool EXPAND(int Row_Indx){
int L_INDX = 0;
int R_INDX = 0;
int MOD = 1;
for(int i = 1; i < INDX.WIDTH; i++){
if(INDX[Row_Indx,i]){
if(L_INDX == 0){L_INDX = i}
R_INDX = i;
}
}

while((L_INDX-MOD) > 0 && (R_INDX+MOD) < INDX.WIDTH){

//Try to Add onto the Left
INDX[Row_INDX,L_INDX - MOD] = 1;
T1 = TEST_UPDATE(Row_Indx);
if(T1){return T1;}
INDX[ROW_INDX,L_INDX - MOD] = 0;

//Try to Add onto the Right
INDX[Row_INDX,R_INDX + MOD] = 1;
T1 = TEST_UPDATE(Row_Indx);
if(T1){return T1;}
INDX[ROW_INDX,R_INDX + MOD] = 0;

MOD++;
}
return false;
}

bool FIND_PDRMS(int LENGTH){
bool FOUND = false;
for(int i = 0; i < INDX.Height; i++){
if(INDX[i,0]){
INDX[i,0] = EXPAND(i);
FOUND = FOUND || E_INDX[i,0];
}
}

return FOUND;
}

void Initialize_Array(){
for(int i = 0; i < O_INDX.Height; i++){
INDX[i,0] = 1;
INDX[i,i+1] = 1;
}
}


while(PDRMS){
Initialize Array();
PDRMS = FIND_PDRM(LENGTH+1);
if(PDRMS){LENGTH++;}
}
std::cout << "Longest Palindrome has length: " << LENGTH << std::endl;