赶紧去补一发树状数组,好像这个数据结构在NOIP里考察的频率挺高啊……(一口奶)
考虑题目中三元组里的中间项
j
,发现需要求出位置和权值都小于
于是我们用两个树状数组来维护上述的
l
和
p.s.因为这题的三元组要求严格上升,我定义权值从小到大排序,对于权值相同的节点,把位置从大到小排序,这样位置较大的点就对位置较小的点不产生影响了。(真的套路)
附上AC代码:
#include <cstdio>
#include <cctype>
#include <algorithm>
#include <cstring>
using namespace std;
const int N=3e4+10;
struct note{
int w,wz;
bool operator < (const note lyf) const {return w==lyf.w?wz>lyf.wz:w<lyf.w;}
}a[N];
int n,t[N],l[N],r[N];
long long ans;
inline char nc(void){
static char ch[100010],*p1=ch,*p2=ch;
return p1==p2&&(p2=(p1=ch)+fread(ch,1,100010,stdin),p1==p2)?EOF:*p1++;
}
inline void read(int &a){
static char c=nc();int f=1;
for (;!isdigit(c);c=nc()) if (c=='-') f=-1;
for (a=0;isdigit(c);a=(a<<3)+(a<<1)+c-'0',c=nc());
return (void)(a*=f);
}
#define lowbit(x) ((x)&(-x))
inline int query(int x){int sum=0; for (int i=x; i; i-=lowbit(i)) sum+=t[i]; return sum;}
inline void change(int x){for (int i=x; i<=n; i+=lowbit(i)) ++t[i];}
inline int ask(int x){int sum=0; for (int i=x; i<=n; i+=lowbit(i)) sum+=t[i]; return sum;}
inline void add(int x){for (int i=x; i; i-=lowbit(i)) ++t[i];}
int main(void){
scanf("%d",&n);
for (int i=1; i<=n; ++i) read(a[i].w),a[i].wz=i;
sort(a+1,a+1+n);
for (int i=1; i<=n; ++i) l[i]=query(a[i].wz),change(a[i].wz);
memset(t,0,sizeof t);
for (int i=n; i; --i) r[i]=ask(a[i].wz),add(a[i].wz);
for (int i=1; i<=n; ++i) ans+=1ll*l[i]*r[i];
return printf("%lld\n",ans),0;
}