Educational Codeforces Round 32 A. Local Extrema(模拟水题)
来源:互联网 发布:手机房屋平面设计软件 编辑:程序博客网 时间:2024/06/09 20:31
You are given an array a. Some element of this array ai is a local minimum iff it is strictly less than both of its neighbours (that is, ai < ai - 1and ai < ai + 1). Also the element can be called local maximum iff it is strictly greater than its neighbours (that is, ai > ai - 1 and ai > ai + 1). Since a1 and an have only one neighbour each, they are neither local minima nor local maxima.
An element is called a local extremum iff it is either local maximum or local minimum. Your task is to calculate the number of local extrema in the given array.
The first line contains one integer n (1 ≤ n ≤ 1000) — the number of elements in array a.
The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 1000) — the elements of array a.
Print the number of local extrema in the given array.
31 2 3
0
41 5 2 5
2
今晚心血来潮打了一场cf,水几发博客hhhh,这题太水了不说
代码:
#include<string.h>#include<stdlib.h>#include<queue>#include<stack>#include<math.h>#include<vector>#include<map>#include<set>#include<stdlib.h>#include<cmath>#include<string>#include<algorithm>#include<iostream>using namespace std;#define lson k*2#define rson k*2+1#define M (t[k].l+t[k].r)/2#define ll long longint main(){ int n,i,j,ans=0; int a[1005]; scanf("%d",&n); for(i=0;i<n;i++) scanf("%d",&a[i]); for(i=1;i<n-1;i++) { if(a[i-1]>a[i]&&a[i+1]>a[i]||a[i-1]<a[i]&&a[i+1]<a[i]) ans++; } printf("%d\n",ans);return 0;}
- Educational Codeforces Round 32 A. Local Extrema(模拟水题)
- Codeforces 888A Local Extrema
- CodeForces 888A Local Extrema
- codeforces 888A.Local Extrema
- Educational Codeforces Round 10(A)模拟
- Educational Codeforces Round 2 A. Extract Numbers(模拟)
- Educational Codeforces Round 1 (A)模拟
- Educational Codeforces Round 5(A) 模拟
- A. Local Extrema
- Codeforces-Educational Codeforces Round 32-(A,B,C,D)
- Educational Codeforces Round 32 B. Buggy Robot(模拟)
- Educational Codeforces Round 32 C. K-Dominant Character(模拟)
- Educational Codeforces Round 6 (B)模拟
- Educational Codeforces Round 7(B)模拟
- Educational Codeforces Round 11(B)模拟
- Educational Codeforces Round 32 A B C
- Educational Codeforces Round 6 (A)贪心
- Educational Codeforces Round 7(A)数学
- HoloLens开发笔记(一)- 开发环境配置及通过Visual Studio运行项目
- 生成器迭代器
- 魔方之串口通信
- 独轮车 推车的人脑子绕不过弯来 导致我写了好久
- mac下安装tomcat并配置Myeclipse过程
- Educational Codeforces Round 32 A. Local Extrema(模拟水题)
- PAT (Basic Level) Practise (中文)1037. 在霍格沃茨找零钱(20)
- win32 sdk下调用webbrowser控件
- Educational Codeforces Round 32 B. Buggy Robot(模拟)
- nginx 从入门到实践 -基础篇(2)
- SpringMVC(2)-- 常用注解类
- 软件工程(C编码实践篇)学习总结
- Educational Codeforces Round 32 C. K-Dominant Character(模拟)
- Maven工程的SpringMVC结构的Web程序