Next Smallest Palindrome

#include <bits/stdc++.h>

using namespace std;

void largerpalindrome(int arr[], int n){
    int mid = n/2;
    int i = mid-1;
    int j= n%2?mid+1:mid;
    bool leftsmaller = false;
    while(i>=0 && arr[i]==arr[j]){
        i--;
        j++;
    }
    if(i<0&&arr[i]<arr[j]){
        leftsmaller = true;
    }
    while(i>=0){
        arr[j++] =arr[i--];
    }
    if(leftsmaller == true){
        int carry = 1;
        i = mid-1;
        if(n%2){
            arr[mid]+=carry;
            carry = arr[mid]/10;
            arr[mid] %=10;
            j = mid+1;
        }
        else{
            j = mid;
        }
        while(i>=0){
            arr[i]+=carry;
            carry = arr[i]/10;
            arr[i] %=10;
            arr[j++] = arr[i--];
        }
    }
}
int main()
{
   int n;
   cin>>n;
   int arr[n];
   for(int i=0;i<n;i++){
       cin>>arr[i];
   }
   largerpalindrome(arr, n);
   for(int i=0;i<n;i++){
       cout<<arr[i]<<" ";
   }
   
   return 0;
}