题解 | 打印极值点下标

#include <iostream>
#include<algorithm>
#include<vector>
#include<map>
#include<string>
#include<cstring>
using namespace std;
int main() {
	int k;
	while (cin >> k) {
		vector<int> v1;
		vector<int> vcout;		int a;
		vector<int>::iterator it;
		for (int i = 0; i < k; i++) {
			cin >> a;
			v1.push_back(a);
		}
		for (int i = 0; i < k; i++) {
			if (i == 0) {
				if (v1[i]> v1[i + 1]|| v1[i] < v1[i + 1])vcout.push_back(i);
			}
			else if (i == k - 1) {
				if (v1[i] < v1[i - 1]|| v1[i]>v1[i - 1])vcout.push_back(i);
			}
			else {
				if ((v1[i] > v1[i - 1] && v1[i] > v1[i + 1] )|| (v1[i] < v1[i - 1] && v1[i] < v1[i + 1])) {
					vcout.push_back(i);
				
				}
			}
		}
		for (it = vcout.begin(); it != vcout.end(); it++) {
			cout << *it << " ";
		}

		cout << endl;
	}
}