Submission #298829

---

Source Code Expand

#include <iostream>
#include <sstream>
#include <fstream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <algorithm>
#include <utility>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cstring>
#include <cstdio>

using namespace std;

#define REP(i,n) for((i)=0;(i)<(int)(n);(i)++)
#define foreach(c,itr) for(__typeof((c).begin()) itr=(c).begin();itr!=(c).end();itr++)

int b[100020], n;

typedef long long ll;

typedef pair<int,int> P;

ll solve() {
  // priority_queue<int, vector<int>, greater<int>> Q;

  vector<P> vp;
  for (int i = 0; i < n; i++) {
    vp.push_back(P(b[i], i));
  }

  sort(vp.begin(), vp.end());

  ll ans = 0;

  for(int i = 0; i < n; i++) {
    P p = vp[i];
    int idx = p.second;
    int val = p.first;

    //printf("%d,%d\n", val, idx);

    // l
    ll lcnt = 0;
    for (int j = idx - 1; j >= 0; j--) {
      if (b[j] == -1) continue;
      //printf("lcnt - %d vs %d\n", val, b[j]);
      if (val < b[j]) {
        ++lcnt;
      }
    }

    // r
    ll rcnt = 0;
    for (int j = idx + 1; j < n; j++) {
      if (b[j] == -1) continue;
      //printf("rcnt - %d vs %d\n", val, b[j]);
      if (val < b[j]) ++rcnt;
    }

    ans += min(lcnt, rcnt);

    b[idx] = -1;

  }

  return ans;
}

int main() {

  while (cin >> n) {
    for(size_t i = 0; i < n; i++)
    {
      cin >> b[i];
    }

    printf("%lld\n", solve());
  }

  return 0;
}

Submission Info

Judge Result