Submission #1244319

---

Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <stack>
#include <map>
#include <cstdio>
#include <math.h>
#include <utility>
#include <list>
#include <functional>
#include <queue>
using namespace std;

#define ll long long
#define vecint vector<int>
#define Pii pair<int, int>

#define REP(i,x,n) for(int i=x;i<n;i++)
#define rep(i,n) REP(i,0,n)
#define print(a) cout << a << endl

#define MOD 1000000007
#define NIL -1

int N;
int a[100000+1];

ll f(int x){
    return x*(x+1)/2;
}

void solve(){
    ll ans=0;
    int count=1;
    int x0=a[0],x1;
    REP(i,1,N){
        x1=a[i];
        if(x1>x0){
            count++;
        }else{
            ans+=f(count);
            count=1;
        }
        if(i==N-1) ans+=f(count);
        x0=x1;
    }
    print(ans);
    return;
}



int main(){
    cin>>N;
    rep(i,N) cin>>a[i];
    solve();
    return 0;
}

Submission Info

Judge Result