Submission #1190847

#TimeUsernameProblemLanguageResultExecution timeMemory
1190847vusalMountains (NOI20_mountains)C++20
36 / 100
2096 ms2628 KiB
#include <bits/stdc++.h>
using namespace std;

#define int long long

const int oo = 1e18;
const int MAXN = 1e5 + 7;

void _()
{
    int n, cnt = 0;;
    cin >> n;

    vector<int>v(n);
    for(int &i : v) cin >> i;

    for(int i = 0; i < (n - 2); i++)
    {
        for(int j = i + 1; j < (n - 1); j++)
        {
            if(v[i] < v[j])
            {
                for(int k = j + 1; k < n; k++)
                {
                    if(v[k] < v[j])
                    {
                        cnt++;
                    }
                }
            }
        }
    }

    cout << cnt << endl;
}   

signed main()
{
    int tt = 1;
    // cin >> tt;
    while(tt--) _();
}
#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...