fork download
copy 
  1. /* AUTHOR: TUAN ANH - BUI */
  2. // ~~ icebear ~~
  3. #include <bits/stdc++.h>
  4. using namespace std;
  5.  
  6. typedef long long ll;
  7. typedef pair<int, int> ii;
  8. typedef pair<int, ii> iii;
  9.  
  10. template<class X, class Y>
  11.     bool minimize(X &x, const Y &y) {
  12.         if (x > y) return x = y, true;
  13.         return false;
  14.     }
  15.  
  16. template<class X, class Y>
  17.     bool maximize(X &x, const Y &y) {
  18.         if (x < y) return x = y, true;
  19.         return false;
  20.     }
  21.  
  22. #define FOR(i,a,b) for(int i=(a); i<=(b); ++i)
  23. #define FORR(i,a,b) for(int i=(a); i>=(b); --i)
  24. #define REP(i, n) for(int i=0; i<(n); ++i)
  25. #define RED(i, n) for(int i=(n)-1; i>=0; --i)
  26. #define MASK(i) (1LL << (i))
  27. #define BIT(S, i) (((S) >> (i)) & 1)
  28. #define mp make_pair
  29. #define pb push_back
  30. #define fi first
  31. #define se second
  32. #define all(x) x.begin(), x.end()
  33. #define task "icebear"
  34. /*END OF TEMPLATE. ICEBEAR AND THE CAT WILL WIN VOI26 */
  35.  
  36. const int MOD = 1e9 + 7;
  37. const int inf = (int)1e9 + 27092008;
  38. const ll INF  = (ll)1e18 + 27092008;
  39. const int N = 2e5 + 5;
  40. int n, q, node[N << 2], lazy[N << 2], a[N], pos[N];
  41.  
  42. void pushDown(int id, int l, int r) {
  43.     if (lazy[id]) {
  44.         int mid = (l + r) >> 1;
  45.         node[id << 1] += lazy[id] * (mid - l + 1);
  46.         node[id << 1 | 1] += lazy[id] * (r - mid);
  47.         lazy[id << 1] += lazy[id];
  48.         lazy[id << 1 | 1] += lazy[id];
  49.         lazy[id] = 0;
  50.     }
  51. }
  52.  
  53. void update(int id, int l, int r, int u, int v, int k) {
  54.     if (l > v || r < u) return;
  55.     if (u <= l && r <= v) {
  56.         node[id] += (r - l + 1) * k;
  57.         lazy[id] += k;
  58.         return;
  59.     }
  60.     pushDown(id, l, r);
  61.     int mid = (l + r) >> 1;
  62.     update(id << 1, l, mid, u, v, k);
  63.     update(id << 1 | 1, mid + 1, r, u, v, k);
  64.     node[id] = node[id << 1] + node[id << 1 | 1];
  65. }
  66.  
  67. int get(int id, int l, int r, int u, int v) {
  68.     if (l > v || r < u || u > v) return 0;
  69.     if (u <= l && r <= v) return node[id];
  70.     pushDown(id, l, r);
  71.     int mid = (l + r) >> 1;
  72.     return get(id << 1, l, mid, u, v) + get(id << 1 | 1, mid + 1, r, u, v);
  73. }
  74.  
  75. void init(void) {
  76.     cin >> n;
  77.     FOR(i, 1, n) cin >> a[i], pos[a[i]] = i;
  78. }
  79.  
  80. void process(void) {
  81.     FOR(i, 1, n) update(1, 1, n, i, i, +1);
  82.     FOR(i, 1, n) {
  83.         int v = (i % 2 == 1 ? i / 2 + 1 : n - i / 2 + 1);
  84.         if (i % 2 == 1) cout << get(1, 1, n, 1, pos[v] - 1) << '\n';
  85.         else cout << get(1, 1, n, pos[v] + 1, n) << '\n';
  86.         update(1, 1, n, pos[v], pos[v], -1);
  87.  
  88.     }
  89. }
  90.  
  91. int main() {
  92.     ios_base::sync_with_stdio(0);
  93.     cin.tie(0); cout.tie(0);
  94.     if (fopen(task".inp", "r")) {
  95.         freopen(task".inp", "r", stdin);
  96.         freopen(task".out", "w", stdout);
  97.     }
  98.     int tc = 1;
  99. //    cin >> tc;
  100.     while(tc--) {
  101.         init();
  102.         process();
  103.     }
  104.     return 0;
  105. }
  106.  
  107.  
Success #stdin #stdout 0.01s 5320KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/u5Ym05
language:
C++14 (gcc 8.3)
created:
7 hours ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!