#include <stdio.h>
#define N 1000
int main()
{
int n, i, a[N], b[N], s = 0;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf_s("%d", &a[i]);
b[0] = a[1] - a[0];
for (i = 1; i < n - 1; i++)
{
b[i] = a[i + 1] - a[i];
if (b[i] > 0 && b[i - 1] < 0)
s++;
else
if (b[i] < 0 && b[i - 1]>0)
s++;
}
printf("%d", s);
return 0;
}
#CSP 201609-1 最大波动
猜你喜欢
转载自blog.csdn.net/weixin_45884316/article/details/104339573
今日推荐
周排行