Contest Duration: ~ (local time) (100 minutes) Back to Home

Submission #6191382

Source Code Expand

Copy
```#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
//---------------------------------------------------------------------------------------------------
/*---------------------------------------------------------------------------------------------------
∧＿∧
∧＿∧ 　（´<_｀ ）　 Welcome to My Coding Space!
（ ´_ゝ`）　/　 ⌒i     @hamayanhamayan
／　　　＼　 　  |　|
/　　 /￣￣￣￣/　　|
＿_(__ﾆつ/　    ＿/ .| .|＿＿＿＿
＼/＿＿＿＿/　（u　⊃
---------------------------------------------------------------------------------------------------*/

int N, P[20];
//---------------------------------------------------------------------------------------------------
void _main() {
cin >> N;
rep(i, 0, N) cin >> P[i];

int ans = 0;
rep(i, 1, N - 1) {
int mi = min({ P[i - 1], P[i], P[i + 1] });
int ma = max({ P[i - 1], P[i], P[i + 1] });
if (mi != P[i] and ma != P[i]) ans++;
}
cout << ans << endl;
}

```

#### Submission Info

Submission Time 2019-06-30 09:47:12+0900 B - Ordinary Number hamayanhamayan C++14 (GCC 5.4.1) 200 1672 Byte AC 1 ms 256 KB

#### Test Cases

Set Name Score / Max Score Test Cases
All 200 / 200 sample_01, sample_02, testcase_01, testcase_02, testcase_03, testcase_04, testcase_05, testcase_06, testcase_07, testcase_08, testcase_09, testcase_10, testcase_11, testcase_12
Sample 0 / 0 sample_01, sample_02
Case Name Status Exec Time Memory
sample_01 1 ms 256 KB
sample_02 1 ms 256 KB
testcase_01 1 ms 256 KB
testcase_02 1 ms 256 KB
testcase_03 1 ms 256 KB
testcase_04 1 ms 256 KB
testcase_05 1 ms 256 KB
testcase_06 1 ms 256 KB
testcase_07 1 ms 256 KB
testcase_08 1 ms 256 KB
testcase_09 1 ms 256 KB
testcase_10 1 ms 256 KB
testcase_11 1 ms 256 KB
testcase_12 1 ms 256 KB