#include

#include

#include

class SmallestPermutation $\{$

public:

std::vector findSmallestPermutation$($const std::string& s$)\{$

int n $=$ s$.$length$()+1$;

std::vector permutation$($n$)$;

$//$ Initialize the permutation with $1$ to n

for $($int i $=0$; i $<$ n; $++$i$)\{$

permutation$[$i$]=$ i $+1$;

$\}$

$//$ Apply $\text{'}$I$\text{'}$ and $\text{'}$D$\text{'}$ instructions

for $($int i $=0$; i $<$ n $-1$; $++$i$)\{$

if $($s$[$i$]==\text{'}$D$\text{'})\{$

std::reverse$($permutation$.$begin$()+$ i$,$ permutation.begin$()+$ i $+2)$;

$\}$

$\}$

return permutation;

$\}$

$\}$;

int main$()\{$

$//$ Example usage

std::string s $="$DI$"$;

SmallestPermutation smallestPerm;

std::vector result $=$ smallestPerm.findSmallestPermutation$($s$)$;

$//$ Output the result

std::cout $<<$ "Input: $"<<$ s $<<$ std::endl;

std::cout $<<$ "Output: $["$;

for $($int i $=0$; i $<$ result.size$()$; $++$i$)\{$

std::cout $<<$ result$[$i$]$;

if $($i $<$ result.size$()-1)\{$

std::cout $<<","$;

$\}$

$\}$

std::cout $<<"]"<<$ std::endl;

return $0$;

$\}$ imorove this code in cpp so that it passes all test case