brute force data structures dp *1600

Please click on ads to support us..

C++ Code:

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;


void solve() {
	int n;
	cin >> n;
	vector<int> a(n);
	for(int i = 0; i < n; i++) {
		cin >> a[i];
	}
	ll ans = 0;
	vector<int> cnt(n);
	for(int b = 0; b < n; b++) {
		int d = 0;
		for(int c = n - 1; c > b; c--) {
			ans += cnt[c] * d;
			cnt[c] += a[b] < a[c];
			d += a[b] > a[c];
		}
	}
	cout << ans << "\n";
} 


int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);


	int T = 1;
	cin >> T;
	while(T--) solve();
	
	return 0;
}


Comments

Submit
0 Comments
More Questions

17A - Noldbach problem
1350A - Orac and Factors
1373A - Donut Shops
26A - Almost Prime
1656E - Equal Tree Sums
1656B - Subtract Operation
1656A - Good Pairs
1367A - Short Substrings
87A - Trains
664A - Complicated GCD
1635D - Infinite Set
1462A - Favorite Sequence
1445B - Elimination
1656C - Make Equal With Mod
567A - Lineland Mail
1553A - Digits Sum
1359B - New Theatre Square
766A - Mahmoud and Longest Uncommon Subsequence
701B - Cells Not Under Attack
702A - Maximum Increase
1656D - K-good
1426A - Floor Number
876A - Trip For Meal
1326B - Maximums
1635C - Differential Sorting
961A - Tetris
1635B - Avoid Local Maximums
20A - BerOS file system
1637A - Sorting Parts
509A - Maximum in Table