题解 | 打印极值点下标

#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;

int main()
{
    int n;
    while(cin>>n)
    {
        int arr[100];
        vector<int> ans;
        for(int i=0;i<n;i++)
        {
           cin>>arr[i];
        }
        int count=0;
        if(arr[0]>arr[1] || arr[0]<arr[1])
        {
            count++;
            ans.push_back(0);
        }
        for(int j=1;j<n-1;j++)
        {
           if((arr[j]>arr[j+1]&&arr[j]>arr[j-1]) || (arr[j]<arr[j+1]&&arr[j]<arr[j-1]))
           {
              count++;
              ans.push_back(j);
           }
        }
        if(arr[n-1]>arr[n-2] || arr[n-1]<arr[n-2])
        {
            count++;
            ans.push_back(n-1);
        }
        
        //cout<<count<<endl;
        for(int h:ans)
        {
            cout<<h<<" ";
        }
        cout<<endl;
    }
    return 0;
}