算法题：找到一个数，这个数左边都比这个数小，右边都比这个数大

#include <iostream>
#include <vector>
#include <limits.h>
#include <math.h>
#include <algorithm>
using namespace std;

void dfs(vector<int>& nums)
{
    int len = nums.size();
    vector<int> dp(len, INT_MIN);
    for (int i = 1; i < len; i++)
    {
        if (nums[i - 1] > dp[i - 1]) dp[i] = nums[i - 1];
        else dp[i] = dp[i - 1];
    }
    int rmin = INT_MAX;
    int i = len - 2;
    for (; i >= 1; i--)
    {
        rmin = min(rmin, nums[i + 1]);
        if (dp[i] < nums[i] && nums[i] < rmin) cout << nums[i] << endl;
    }
}

int main()
{
    int t;
    while (cin >> t)
    {
        vector<int> vec;
        int tmp;
        for (int i = 0; i < t; i++)
        {
            cin >> tmp;
            vec.push_back(tmp);
        }
        dfs(vec);
    }
    return 0;
}