Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <cmath>
- #include <cstdio>
- #include <vector>
- #include <iostream>
- #include <algorithm>
- using namespace std;
- int main() {
- int N, total = 0;
- cin >> N;
- int arr[N], permen[N] = {1}, permen2[N] = {};
- for (int i = 0; i < N; i++) {
- cin >> arr[i];
- if (i != 0) {
- if (arr[i] > arr[i - 1]) permen[i] = permen[i - 1] + 1;
- if (arr[i] <= arr[i - 1]) permen[i] = 1;
- }
- }
- permen2[N - 1] = 1;
- for (int i = N - 2; i >= 0; i--) {
- if (arr[i] > arr[i + 1]) permen2[i] = permen2[i + 1] + 1;
- if (arr[i] <= arr[i + 1]) permen2[i] = 1;
- }
- for (int i = 0; i < N; i++) total += max(permen[i], permen2[i]);
- cout << total;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement