#include <iostream> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int w = 0; int n; cin >> n; int t[n]; for (int i = 0; i < n; i++) { cin >> t[i]; } bool up = true; if (t[0] > t[1]) up = false; int k = 0; int p = 0; int i = 1; while (i < n) { if ((up && t[i] >= t[i -1]) || (!up && t[i] <= t[i -1])) { if (t[i] == t[i-1]) { p++; } k++; i++; } else { w += k/2 + p/2; k = 0; p = 0; up = !up; } } w += k/2+ p/2; cout << w; return 0; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 | #include <iostream> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int w = 0; int n; cin >> n; int t[n]; for (int i = 0; i < n; i++) { cin >> t[i]; } bool up = true; if (t[0] > t[1]) up = false; int k = 0; int p = 0; int i = 1; while (i < n) { if ((up && t[i] >= t[i -1]) || (!up && t[i] <= t[i -1])) { if (t[i] == t[i-1]) { p++; } k++; i++; } else { w += k/2 + p/2; k = 0; p = 0; up = !up; } } w += k/2+ p/2; cout << w; return 0; } |