Submission #1253886

#TimeUsernameProblemLanguageResultExecution timeMemory
1253886JerMountains (NOI20_mountains)C++20
36 / 100
1 ms328 KiB
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
const int MAXN = 1005;

ll h[MAXN];
int a[MAXN], n;

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

	cin >> n;
	for (int i = 0; i < n; i++) cin >> h[i];

	for (int i = 0; i < n; i++)
		for (int j = i + 1; j < n; j++)
			a[i] += (h[i] > h[j]);

	ll res = 0;	
	for (int i = 0; i < n; i++)
		for (int j = i + 1; j < n; j++)
			if (h[j] > h[i]) res += (ll)a[j];

	cout << res << '\n';

	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...