888A - Local Extrema - CodeForces Solution

brute force implementation *800

Please click on ads to support us..

Python Code: 

from operator import xor

v = int(input())
a = list(map(int, input().split()))
n = 0
for i in range(1, v-1):

    if a[i] > a[i + 1] and a[i] > a[i - 1]:
        n += 1
    elif a[i] < a[i + 1] and a[i] < a[i - 1]:
        n += 1
        print(n)

C++ Code: 

#include<bits/stdc++.h>
using namespace std;
const int N=1e5+5;
int n;
int a[N];
void work(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++) scanf("%d",&a[i]);
	int ans=0;
	for(int i=2;i<=n-1;i++){
		if(a[i-1]<a[i]&&a[i]>a[i+1]) ans++;
		if(a[i-1]>a[i]&&a[i]<a[i+1]) ans++;
	}
	printf("%d\n",ans);
}
int main(){
	work();
	return 0;
}


Comments

Submit
0 Comments
More Questions

320A - Magic Numbers
1658A - Marin and Photoshoot
514A - Chewbaсca and Number
382A - Ksenia and Pan Scales
734B - Anton and Digits
1080A - Petya and Origami
1642D - Repetitions Decoding
1440A - Buy the String
1658F - Juju and Binary String
478A - Initial Bet
981A - Antipalindrome
365A - Good Number
1204B - Mislove Has Lost an Array
1409D - Decrease the Sum of Digits
1476E - Pattern Matching
1107A - Digits Sequence Dividing
1348A - Phoenix and Balance
1343B - Balanced Array
1186A - Vus the Cossack and a Contest
1494A - ABC String
1606A - AB Balance
1658C - Shinju and the Lost Permutation
1547C - Pair Programming
550A - Two Substrings
797B - Odd sum
1093A - Dice Rolling
1360B - Honest Coach
1399C - Boats Competition
1609C - Complex Market Analysis
1657E - Star MST