Submission #1181698

#	Time	Username	Problem	Language	Result	Execution time	Memory
1181698		kaanpasaa	Mountains (NOI20_mountains)	C++20	36 / 100	2096 ms	2632 KiB

Mountains

#include<bits/stdc++.h> 
#include<iostream>
#include<vector>
#include<map>
#include<set>
#include<bitset>
#define int long long
#define spc <<" "<<
#define vi vector<int>
#define pii pair<int,int>
#define vpii vector<pair<int,int>>
#define dfab int a,b;cin>>a>>b;
#define dfa int a;cin>>a;
#define ff first 
#define ss second
#define pb push_back
#define dfoutput if(cvp){cout<<"YES\n";}else{cout<<"NO\n";}
#define dfnarr int n;cin>>n;int arr[n];for(int i=0;i<n;i++){cin>>arr[i];}
#define mod 1000000007
#define mod2 998244353
#define inf 1e18
#define N 1e5+10
#define C 1e9+10
#define all(x) x.begin(),x.end()
using namespace std;
void solve() {
    int n;cin>>n;
    int arr[n];
    for(int i=0;i<n;i++){
        cin>>arr[i];
    }
    int cvp=0;
    for(int x=0;x<n-2;x++){
        for(int y=x+1;y<n;y++){
            for(int z=y+1;z<n;z++){
                if(arr[y]>arr[x] && arr[y]>arr[z])cvp++;
            }
        }
    }
    cout<<cvp;
}
signed main(){ 
    int t=1;
    //cin>>t;
    while(t--){ 
        solve();
    }
}

• Subtask 1: 0 / 2
• Subtask 2: 0 / 4
• Subtask 3: 0 / 9
• Subtask 4: 36 / 36
• Subtask 5: 0 / 28
• Subtask 6: 0 / 9
• Subtask 7: 0 / 12