Check out this guys


#1

vector Solution::solve(vector &A) {
int max=0;
vectorb;
for(int i=A.size()-1;i>=0;i–)
{
if(max<A[i])
{
max=A[i];
b.push_back(max);
}
}
return b;
}


#2

very nice!:smiley:
fast and smart