제출 #570163

#제출 시각아이디문제언어결과실행 시간메모리
570163ChrisM2309Mountains (NOI20_mountains)C++14
0 / 100
2076 ms1492 KiB
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> ii;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<ii> vii; 
typedef vector<vii> wgraf;
typedef pair<int,ii> edge;

#define UNVISITED 0
#define VISITED 1
#define INF 1000000000
#define pb push_back
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
ll ans = 0;
void RESOLVER(){
    int n;
    cin >> n;
    vi data(n);
    for (auto &i : data) cin >> i;
    for (int i = 0; i < n; i++){
        int iz = 0, der = 0;
        for (int j = i - 1; j >= 0; j--){
            if (data[j] < data[i]) iz++;
        }
        for (int j = i + 1; j < n; j++){
            if (data[j] < data[i]) der++;
        }
        ans += (der * iz);
    }    
    cout << ans;
    
}
int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t = 1;
  //cin >> t;
  while(t--){
    RESOLVER();
  }
}
#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...