# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
740943 | Kakarot | Mountains (NOI20_mountains) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>#define ll long long intusing namespace std;void setIO() { ios_base::sync_with_stdio(false); cin.tie(NULL);}int main() { setIO(); int n; cin >> n; ll a[n]; for(int i = 0;i < n;++i) cin >> a[i]; ll ans = 0; for(int i = 0;i < n-2;++i) { for(int j = i+1;j < n-1;++j) { for(int k = j+1;k < n;++k) { if(a[i] < a[j] && a[j] > a[k]) ans++; } } } cout << ans; return 0;}