题目还帮你排好序了,太好了
其实这个问题就是个裸的逆序对
我们知道如何在一个序列中计算每个数后边有多少个数比他小
这样,我们就有一种思路
倒序扫描 a a a,利用树状数组求出每个 a [ i ] a[i] a[i] 后边有多少个数比他大记做 r i g h t [ i ] right[i] right[i]
正序扫描 a a a,利用树状数组求出每个 a [ i ] a[i] a[i] 前边有多少个数比他大记做 l e f t [ i ] left[i] left[i]
“V”字形的答案就是 ∑ i = 1 n l e f t [ i ] ∗ r i g h t [ i ] \sum\limits_{i=1}^nleft[i]*right[i] i=1∑nleft[i]∗right[i]
"^"字形的答案也是用类似的方法搞
开ll不用说吧
#include <map>
#include <set>
#include <ctime>
#include <queue>
#include <stack>
#include <cmath>
#include <vector>
#include <bitset>
#include <cstdio>
#include <cctype>
#include <string>
#include <numeric>
#include <cstring>
#include <cassert>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <functional>
using namespace std ;
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define loop(s, v, it) for (s::iterator it = v.begin(); it != v.end(); it++)
#define cont(i, x) for (int i = head[x]; i; i = e[i].nxt)
#define clr(a) memset(a, 0, sizeof(a))
#define ass(a, sum) memset(a, sum, sizeof(a))
#define lowbit(x) (x & -x)
#define all(x) x.begin(), x.end()
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define iv inline void
#define enter cout << endl
#define siz(x) ((int)x.size())
#define file(s) freopen(s".in", "r", stdin), freopen(s."out", "w", stdout)
typedef long long ll ;
typedef unsigned long long ull ;
typedef pair <int, int> pii ;
typedef vector <int> vi ;
typedef vector <pii> vii ;
typedef queue <int> qi ;
typedef set <int> si ;
typedef map <int, int> mii ;
typedef map <string, int> msi ;
const int N = 200010 ;
const int INF = 0x3f3f3f3f ;
const int iinf = 1 << 30 ;
const ll linf = 2e18 ;
const int MOD = 1000000007 ;
const double eps = 1e-7 ;
void print(int x) { cout << x << endl ; exit(0) ; }
void PRINT(string x) { cout << x << endl ; exit(0) ; }
void douout(double x){ printf("%lf\n", x + 0.0000000001) ; }
int n ;
int a[N], bit[N] ;
ll l[N], r[N] ;
ll ans1, ans2 ;
void add(int x) {
for (; x <= n; x += lowbit(x)) bit[x]++ ;
}
ll ask(int x) {
ll s = 0 ;
for (; x; x -= lowbit(x)) s += bit[x] ;
return s ;
}
signed main(){
scanf("%d", &n) ;
rep(i, 1, n) scanf("%d", &a[i]) ;
per(i, n, 1) {
r[i] = ask(n) - ask(a[i]) ;
add(a[i]) ;
}
clr(bit) ;
rep(i, 1, n) {
l[i] = ask(n) - ask(a[i]) ;
add(a[i]) ;
}
rep(i, 1, n) ans1 += l[i] * r[i] ;
clr(bit) ; clr(l) ; clr(r) ;
per(i, n, 1) {
r[i] = ask(a[i] - 1) ;
add(a[i]) ;
}
clr(bit) ;
rep(i, 1, n) {
l[i] = ask(a[i] - 1) ;
add(a[i]) ;
}
rep(i, 1, n) ans2 += l[i] * r[i] ;
printf("%lld %lld\n", ans1, ans2) ;
return 0 ;
}
/*
写代码时请注意:
1.ll?数组大小,边界?数据范围?
2.精度?
3.特判?
4.至少做一些
思考提醒:
1.最大值最小->二分?
2.可以贪心么?不行dp可以么
3.可以优化么
4.维护区间用什么数据结构?
5.统计方案是用dp?模了么?
6.逆向思维?
*/