寻找数组中符合条件的值，该元素左侧的值都不大于该元素，右侧的值都不小于该值

参考 https://blog.csdn.net/xiaofei0859/article/details/77570664

void findValue(int a[],int size)
{
	assert(a!=nullptr);
	assert(size!=0);

	int arrtmp[size]={0};
	int min = a[size-1];
	for(auto i = size-1; i>=0;i--)
	{
		if(a[i]<=min)
		{
			min = a[i];
		}
		arrtmp[i] = min;
	}

	int max = a[0];
	for(auto i = 0; i < size; i++)
	{
		if(max <= a[i])
		{
			max = a[i];
		}
		if(a[i] >= max && a[i] <= arrtmp[i])
		{
			cout << a[i] << " ";
		}
	}
	cout << endl;
}