제출 #1328220

#제출 시각아이디문제언어결과실행 시간메모리
1328220michael12Mountains (NOI20_mountains)C++20
36 / 100
2094 ms2628 KiB
#include<bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define int long long
using namespace std;
const int maxn = 1e5 + 5;
const int oo = 1e9 + 7;
signed main(){
   int n;
   cin >> n;
   vector<int> a(n);
   for(int i = 0; i < n; i++){
    cin >> a[i];
   }
   int cur = 0;
   for(int i = 0; i < n; i++){
    for(int j = i + 1; j < n; j++){
        for(int k = j + 1; k < n; k++){
            if(a[j] > a[i] && a[j] > a[k]){
                cur += 1;
            }
        }
    }
   }
   cout << cur;
    // mp[a[0]] = 1;
    // for(int i = 0; i < n - 1; i++){
    //    if(a[i + 1] < a[i]){
    //         if(!mp[a[i + 1] - 1] || !mp[a[i + 1]]){
    //             cur += 1;
    //         }
    //    }
    //    else{
    //        if(!mp[a[i + 1] - 1]){
    //         cur += 1;
    //        }
    //    }
    //    mp[a[i + 1]] = 1;
    // }
    // cout << cur << endl;

    
}
#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...