du3HNG - Online C++ Compiler & Debugging Tool

#include <bits/stdc++.h>
using namespace std;
int getCount(int n,int arr[]){
	vector<int>pre(n+1,0);
	vector<int>suf(n+1,0);
	pre[0]=0;
	for(int j=1;j<n;j++){
		int count=0;
		for(int i=0;i<=j-1;i++){             //as i<k
			if(arr[i]>arr[j]){
				count++;
			}
		}
		pre[j]=count;
	}

	suf[n-1]=0;
	for(int k=n-2;k>=0;k--){
		int count=0;
		for(int l=k+1;l<n;l++){
			if(arr[k]>arr[l]){
				count++;
			}
		}
		suf[k]=count;
	}


	int f_count=0;
	for(int j=0;j<n;j++){
		int count=0;
		for(int k=j+1;k<n;k++){
			if(arr[j]<arr[k]){
				f_count+=pre[j]*suf[k];
			}
		}
	}
	return f_count;


}

int main() {
	// your code goes here
	int n;
	cin>>n;
	int arr[n];
	for(int i=0;i<n;i++){
		cin>>arr[i];
	}
	cout<<"The count of valid triplets are:"<<getCount(n,arr);

	return 0;
}