#include

#include

#include

#include

#include

int findConsistentLogs$($const std::vector& userEvent$)\{$

int n $=$ userEvent.size$()$;

$//$ Step $1$: Calculate the minimum frequency in the entire array

std::unordered$\_$map freq;

for $($int user : userEvent$)\{$

freq$[$user$]+=1$;

$\}$

int min$\_$freq $=$ INT$\_$MAX;

for $($const auto& entry : freq$)\{$

min$\_$freq $=$ std::min$($min$\_$freq, entry.second$)$;

$\}$

$//$ Step $2$: Use sliding window to find the longest consistent subarray

int max$\_$length $=0$;

std::unordered$\_$map window$\_$freq;

int left $=0$;

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

window$\_$freq$[$userEvent$[$right$]]+=1$;

$//$ Check if the current window is consistent

while $(*$std::max$\_$element$($window$\_$freq.begin$(),$ window$\_$freq.end$(),$

$[]($const std::pair& a$,$ const std::pair& b$)\{$ return a$.$second $<$ b$.$second; $\})->$second $>$ min$\_$freq$)\{$

window$\_$freq$[$userEvent$[$left$]]-=1$;

if $($window$\_$freq$[$userEvent$[$left$]]==0)\{$

window$\_$freq.erase$($userEvent$[$left$])$;

$\}$

left $+=1$;

$\}$

$//$ Update the maximum length of consistent subarray

max$\_$length $=$ std::max$($max$\_$length, right $-$ left $+1)$;

$\}$

return max$\_$length;

$\}$

int main$()\{$

std::vector userEvent $=\{1,2,1,3,4,2,4,3,3,3\}$;

std::cout $<<$ findConsistentLogs$($userEvent$)<<$ std::endl; $//$ Output: $8$

return $0$;

$\}$

Please optimize this code