简单计算题

最新推荐文章于 2023-12-30 10:39:50 发布

Map1ew

最新推荐文章于 2023-12-30 10:39:50 发布

阅读量95

点赞数

文章标签：树状数组离散化

本文链接：https://blog.csdn.net/SSL_wujiajie/article/details/108022653

版权

$D e s c r i p t i o n$

$I n p u t$

$O u t p u t$

在这里插入图片描述

$S a m p l e$ $I n p u t$

4
1 4 3 2

$S a m p l e$ $O u t p u t$

$H i n t$

$T r a i n$ $o f$ $T h o u g h t$

见大爷博客吧

#include<algorithm> 
#include<iostream>
#include<cstring>
#include<cstdio>
#define ll long long
using namespace std;

ll sl[100005], sr[100005], bl[100005], br[100005];
ll n, m, Suml, Sumr, Ans;
ll B[100005], C[100005];
struct wh_
{
	ll k, l;
}A[100005];

bool Nm(wh_ i, wh_ j)
{return i.k < j.k;}

ll low(ll k)
{return k & (-k);}

void build(ll k)
{
	for(; k <= n; k += low(k))
		C[k]++;
}

ll Sum(ll k)
{
	ll kt = 0;
	for(; k; k -= low(k))
		kt += C[k];
	return kt;
}

int main()
{
	scanf("%lld", &n);
	for(int i = 1; i <= n; ++i)
		scanf("%lld", &A[i].k), A[i].l = i;
		
	sort(A + 1, A + n + 1, Nm);
	A[0].k = -1;
	for(int i = 1; i <= n; ++i)
		if(A[i].k == A[i - 1].k)B[A[i].l] = m;
		else B[A[i].l] = ++m;
		
	for(int i = 1; i <= n; i++)
	{
		sl[i] = Sum(B[i] - 1);
		bl[i] = Sum(n) - Sum(B[i]);
		Suml += bl[i];
		build(B[i]);
	}
	memset(C, 0, sizeof(C));
	for(int i = n; i >= 1; i--)
	{
		sr[i] = Sum(B[i] - 1);
		br[i] = Sum(n) - Sum(B[i]);
		Sumr += br[i];
		build(B[i]);
	}
	Ans = Suml * Sumr;
	for(int i = 1; i <= n; ++i)
		Ans -= (sl[i] * sr[i]) + (bl[i] * br[i]) + (br[i] * sr[i]) + (bl[i] * sl[i]);
	printf("%lld", Ans);
	return 0;
}