Submission #1181695

#TimeUsernameProblemLanguageResultExecution timeMemory
1181695mehmetkaganMountains (NOI20_mountains)C++20
64 / 100
2097 ms16708 KiB
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll

int32_t main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    int n;
    cin >> n;
    vector<int> h(n);
    for (int &x : h) cin >> x;

    multiset<int> right(h.begin(), h.end()), left;
    int ans = 0;

    for (int i = 0; i < n; ++i) {
        right.erase(right.find(h[i]));

        int l = distance(left.begin(), left.lower_bound(h[i]));
        int r = distance(right.begin(), right.lower_bound(h[i]));
        ans += l * r;

        left.insert(h[i]);
    }

    cout << ans << '\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...