#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){
bool seen=false;
ll cntfull=0;
for(int i=0;i<n;i++){
if(l[i]==0) cntfull++;
}
ll cnt=0;
for(int i=0;i<n;i++){
if(l[i]==0) cnt++;
if(l[i]==1){
say+=cnt*(cntfull-cnt);
}
}
cout<<say<<endl;
return 0;
}
for(int i=1;i<n-1;i++){
ll sol_say=0,sag_say=0;
for(int j=0;j<i;j++){
if(l[j]<l[i]) sol_say++;
}
for(int j=i+1;j<n;j++){
if(l[j]<l[i]) sag_say++;
}
say+=sol_say*sag_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... |