#include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin>>n;
vector<int> v(n);
for(int i=0;i<n;i++){
cin>>v[i];
}
int res=0;
int y=1;
while(y<n-1){
vector<int> left(v.begin(), v.begin() + y);
sort(left.begin(),left.end());
auto l = lower_bound(left.begin(), left.end(), v[y]);
int countl = distance(left.begin(), l);
vector<int> right(v.begin()+y+1, v.end());
sort(right.begin(),right.end());
auto r = lower_bound(right.begin(), right.end(), v[y]);
int countr = distance(right.begin(), r);
res+=countl*countr;
y++;
}
cout<<res<<"\n";
return 0;
}
# | 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... |