#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
    int n;
    cin>>n;
    vector<ll>l(n);
    ll enb=0;
    ll say=0;
    for(int i=0;i<n;i++){
        cin>>l[i];
        enb=max(enb,l[i]);
    }
    if(is_sorted(l.begin(),l.end())){
        cout<<0<<endl;
        return 0;
    }
    if(enb==1){
        int first=-1,last=-1;
        for(int i=0;i<n;i++){
            if(l[i]==0){
                if(first==-1){
                    first=i;
                    last=i;
                    continue;
                }
                last=i;
                say+=last-first-1;
                first=i;
            }
        }
        cout<<say<<endl;
        return 0;
    }
    for(int i=0;i<n;i++){
        for(int j=i+1;j<n;j++){
            if(l[j]>l[i]){
               for(int k=j+1;k<n;k++){
                 if(l[k]<l[j]) say++;
               }
            }
        }
    }
    cout<<say<<endl;
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... |