// task : Teatr [B] // autor : Ryszard Gromek #include <iostream> #include "teatr.h" #include "message.h" using namespace std; long long inw(int * w, int p, int k) { if (p == k) return 0; long long ret = 0; int s = (p + k) / 2; ret += inw(w, p, s); ret += inw(w, s+1, k); int * tym = new int[k+1]; int a = p; int b = s+1; int it = p; while (a < s+1 && b < k + 1) { if (w[a] > w[b]) { ret += s + 1 - a; tym[it] = w[b]; it++; b++; } else { tym[it] = w[a]; a++; it++; } } while (a < s + 1) { tym[it] = w[a]; it++; a++; } while (b < k + 1) { tym[it] = w[b]; it++; b++; } for (int i=p; i<k+1; i++) { w[i] = tym[i]; } delete [] tym; return ret; } int main() { int n = GetN(); int * w = new int[n]; for (int i=0; i<n; i++) { w[i] = GetElement(i); } if (MyNodeId() == 0) { cout << inw(w, 0, n-1); } delete [] w; return 0; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 | // task : Teatr [B] // autor : Ryszard Gromek #include <iostream> #include "teatr.h" #include "message.h" using namespace std; long long inw(int * w, int p, int k) { if (p == k) return 0; long long ret = 0; int s = (p + k) / 2; ret += inw(w, p, s); ret += inw(w, s+1, k); int * tym = new int[k+1]; int a = p; int b = s+1; int it = p; while (a < s+1 && b < k + 1) { if (w[a] > w[b]) { ret += s + 1 - a; tym[it] = w[b]; it++; b++; } else { tym[it] = w[a]; a++; it++; } } while (a < s + 1) { tym[it] = w[a]; it++; a++; } while (b < k + 1) { tym[it] = w[b]; it++; b++; } for (int i=p; i<k+1; i++) { w[i] = tym[i]; } delete [] tym; return ret; } int main() { int n = GetN(); int * w = new int[n]; for (int i=0; i<n; i++) { w[i] = GetElement(i); } if (MyNodeId() == 0) { cout << inw(w, 0, n-1); } delete [] w; return 0; } |