Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- //Слава Україні, Героям слава
- #include <bits/stdc++.h>
- using namespace std;
- template <class T> struct FenwickTree {
- vector<T> fwt;
- int n;
- FenwickTree(int n_) {
- n = n_;
- fwt.assign(n, 0);
- }
- FenwickTree(vector<T>& a) {
- n = (int)a.size();
- fwt.assign(n, 0);
- for (int i = 0; i < (int)a.size(); i++) {
- add(i, a[i]);
- }
- }
- T sum(int r) {
- T ret = 0;
- for (; r >= 0; r = (r & (r + 1)) - 1) {
- ret += fwt[r];
- }
- return ret;
- }
- T query(int l, int r) {
- if (l > r) {
- return 0;
- }
- return sum(r) - sum(l - 1);
- }
- void add(int idx, T delta) {
- for (; idx < n; idx = idx | (idx + 1)) {
- fwt[idx] += delta;
- }
- }
- };
- int main() {
- ios_base::sync_with_stdio(false);
- cin.tie(nullptr);
- int n;
- cin >> n;
- vector<int> v(n);
- FenwickTree<int> fwt(n);
- for(int i = 0; i < n; i++) {
- cin >> v[i];
- }
- for(int i = 0; i < n; i++) {
- cout << v[i] - fwt.sum(v[i] - 1) << " \n"[i == n - 1];
- fwt.add(v[i] - 1, 1);
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement