Submission #1322766

#TimeUsernameProblemLanguageResultExecution timeMemory
1322766bw_isamuMountains (NOI20_mountains)C++20
0 / 100
2095 ms1592 KiB
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

int main() {
    // Fast I/O
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n; cin >> n; // input
    vector<int> a(n);
    for(int i = 0; i < n; i++){
        cin >> a[i];
    }
    int total = 0;
    for(int i = 1; i < n - 1; i++){
        int right = 0;
        int left = 0;
        for(int j = i + 1; j < n; j++){
            if(a[i] > a[j]){
                right++;
            }
        }
        for(int k = i - 1; k >= 0; k--){
            if(a[i] > a[k]){
                left++;
            }
        }
        int ans = right * left;
        total += ans;
    }
    cout << total << endl;
    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...