제출 #1181743

#제출 시각아이디문제언어결과실행 시간메모리
1181743m_a_dMountains (NOI20_mountains)C++20
64 / 100
2095 ms21432 KiB
#include <bits/stdc++.h>

using namespace std;

#define int long long

int32_t main() {
    int length;
    cin >> length;
    int arr[length];
    set<pair<int, int>> mountains;
    for(int i=0; i<length; ++i) cin >> arr[i], mountains.insert({arr[i], i});
    int ans=0;
    //for(auto elem:mountains) cout << elem.first << " " << elem.second << " a";
    for(auto it=mountains.begin(); it!=mountains.end(); ++it) {
        int l=0;
        int r=0;
        for(auto lit=mountains.begin(); lit!=it; ++lit) {
            if(lit->first==it->first) break;
            if(lit->second < it->second) ++l;
            else if(lit->second > it->second) ++r;
        }
        ans+=l*r;
    }
    cout << ans;
    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...