Submission #1814949

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
long n,a[200005],Min[200005],kq=0,Min2;
int main(){
    ios::sync_with_stdio(0);
    cin.tie(NULL);cout.tie(NULL);
    cin >> n;
    for(int i=1;i<=n;i++){
        cin >> a[i];
    }
    Min[n]=a[n];
    for(int i=n-1;i>=1;i--){
        if(a[i]<Min[i+1]) Min[i]=a[i];
        else Min[i]=Min[i+1];
    }
    for(int i=1;i<=n;i++){
        Min2=a[i];
        for(int j=i;j<=n;j++){
            if(a[j]==Min[j]){
                kq+=Min[j]*(n-j+1);
                break;
            }
            else if(a[j]<Min2) {
                Min2=a[j];
                kq+=Min2;
            }
            else kq+=Min2;
            //cout << kq << " ";
        }
    }
    cout << kq;
}

Submission Info

Judge Result