TAChi-T008: Byte Coin

#include <bits/stdc++.h>
using namespace std;

typedef long long lli;

const int N = 1e5 + 5;

int arr[N], mnL[N], mnR[N];

int main(){

    int n;
    scanf("%d", &n);
    for(int i = 1; i <= n; ++i){
        scanf("%d", &arr[i]);
    }
    mnL[1] = 1;
    for(int i = 2; i <= n; ++i){
        if(arr[i] > arr[i - 1]){
            mnL[i] = mnL[i - 1] + 1;
        } else {
            mnL[i] = 1;
        }
    }
    mnR[n] = 1;
    for(int i = n - 1; i >= 1; --i){
        if(arr[i] > arr[i + 1]){
            mnR[i] = mnR[i + 1] + 1;
        } else {
            mnR[i] = 1;
        }
    }
    lli sum = 0;
    for(int i = 1; i <= n; ++i){
        sum += max(mnL[i], mnR[i]);
    }
    cout << sum;

    return 0;
}