树状数组

最新推荐文章于 2024-03-30 14:35:48 发布

zhangche0526

最新推荐文章于 2024-03-30 14:35:48 发布

阅读量330

点赞数

分类专栏：笔记 -线性数据结构 -树

本文链接：https://blog.csdn.net/zhangche0526/article/details/54644894

版权

笔记同时被 3 个专栏收录

34 篇文章 1 订阅

订阅专栏

-树

11 篇文章 1 订阅

订阅专栏

-线性数据结构

6 篇文章 0 订阅

订阅专栏

树状数组

模板

struct FT
{
    int na[MAXN+1];
    int lowbit(int x){return x&(-x);}
    void add(int x,int y){for(;x<=n;x+=lowbit(x)) na[x]+=y;}
    int calSum(int x)
    {
        int res;
        for(;x;x-=lowbit(x)) res+=na[x];
        return res; 
    }
} ft;

应用

求逆序对

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
const int MAXN = 100000;
ll n, cnt, a[MAXN + 1], b[MAXN + 1];//b:树状数组,ls:离散后数组
ll k;
struct mark
{
    ll n, ln;//数值，原先编号; 
} ls[MAXN + 1];

ll lowbit(ll x){return x & (- x);}

void add(ll x, ll y)//x处加上y
{
    for(; x <= n; x += lowbit(x)) 
    {
        b[x] += y;
    }
}

ll sum(ll x)
{
    ll ans = 0;
    for(; x; x -= lowbit(x)) ans += b[x];
    return ans;
}

int cmp(const mark & a, const mark & b){return a.n < b.n;}

int main()
{
    int i, j;
    ios::sync_with_stdio(false);
    while(cin >> n >> k)
    {
        memset(a, 0, sizeof(a));
        memset(b, 0, sizeof(b));
        memset(ls, 0, sizeof(ls));
        for(i = 1; i <= n; i ++) cin >> a[i], ls[i].n = a[i], ls[i].ln = i;

        sort(ls + 1, ls + n + 1, cmp);

        cnt = 1;
        a[ls[1].ln] = cnt;
        for(i = 2; i <= n; i ++)
        {
            if((ls[i - 1].n != ls[i].n)) cnt ++;
            a[ls[i].ln] = cnt;
        }
        ll ans = 0;
        for(i = n; i >= 1; i--)
        {
            ans += sum(a[i] - 1);
            add(a[i], 1);
        }
        if(ans - k < 0) cout << 0 << endl; 
        else cout << ans - k << endl;
    }
    return 0;
}