找出函数的最宽尖峰

#include <cstdio>
#include <cstring>
#include <string>
#include <set>
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

const int MAX = 10000010;
const int UP = 1, DOWN = -1, EQ = 0;

int nums[MAX];

int main()
{
	int n;
	scanf("%d", &n);
	vector<int> tips;
	for (int i = 0; i < n; ++i)
	{
		scanf("%d", &nums[i]);
	}
	for (int i = 0; i < n; ++i)
	{
		if (i != 0 && i != n - 1 && nums[i - 1] < nums[i] && nums[i] > nums[i + 1])
		{
			tips.push_back(i);
		}
	}
	int tipCnt = tips.size(), maxLen = 0;
	int start = -1, end = -1;
	for (int i = 0; i < tipCnt; ++i)
	{
		int len = 1;
		int m = tips[i] - 1, j = tips[i] + 1;
		while (m != 0 && nums[m - 1] < nums[m])
		{
			len++;
			m--;
		}
		while (j != n - 1 && nums[j] > nums[j + 1])
		{
			len++;
			j++;
		}
		if (len > maxLen)
		{
			maxLen = len;
			start = m;
			end = j;
		}
	}
	printf("%d %d\n", start, end);
	return 0;
}

AC