제출 #312835

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
312835		daringtrifles	Mountains (NOI20_mountains)	C++17	36 / 100	2085 ms	8124 KiB

Mountains

//control+option+n to run!
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define pll pair<ll, ll>
#define FOR(i, a, b) for (signed long long i = (signed long long)(a); i < (signed long long)(b); i++)
#define NEGFOR(i, a, b) for (ll i = (a); i > (b); i--)
#define vll vector<long long>
#define sll set<long long>
#define ld long double
#define inf 1000000000000000000
#define mll multiset<long long>
#define vpll vector<pll>
#define nn << "\n"
#define ss << " "
#define F(i, b) for (ll i = 0; i < b; i++)

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    ll n;
    cin >> n;
    vll v(n);
    FOR(i, 0, n)
        cin >> v[i];
    vll before(n, 0), after(n, 0), x;
    ll ans = 0;
 
 
    x.pb(v[0]);
    FOR(i, 1, n)
    {
        before[i] = lower_bound(x.begin(), x.end(), v[i]) - x.begin();
        x.pb(v[i]);
        sort(x.begin(), x.end());
    }
 
    x={};
 
    x.pb(v[n-1]);
    FOR(i, 1, n)
    {
        after[i] = lower_bound(x.begin(), x.end(), v[n-i-1])-x.begin();
        x.pb(v[n-i-1]);
        sort(x.begin(), x.end());
    }
    FOR(i,0,n){
        ans+=before[i]*after[n-1-i];
    }
    cout<<ans;
}

• 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