Submission #1795979

---

Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <map>
#include <vector>
#include <unordered_map>

#define div 1000000000+7

using ll = long long;
using namespace std;

void solve() {
    int count = 0;
    int n;
    cin >> n;
    int a[n];
    for(int i = 0; i < n; i++){
        cin >> a[i];
    }
    for(int i = 0; i < n; i++){
        for(int j = i+1; j < n; j++){
            if(a[j-1] >= a[j]){
                break;
            }else if(a[i] < a[j]){
                count++;
            }else{
                break;
            }
        }
    }
    cout << count+n << endl;
}

int main() {
    solve();
    return 0;
}

Submission Info

Judge Result