题目大意:
平面上有N个点,每个点横纵坐标范围1~N,任意两个点的横纵坐标都不相同。
若(x1,y1)(x2,y2)(x3,y3)满足x1 < x2 < x3,y1 > y2&y3 > y2,则称这三个点构成“v”子图腾。
若(x1,y1)(x2,y2)(x3,y3)满足x1 < x2 < x3,y1 < y2&y3 < y2,则称这三个点构成“Λ”
求“v”&“Λ”的个数。
解题思路:
树状数组
楼兰图腾≈模板
Accepted code:
#include<cctype>
#include <iostream>
#include <cstdio>
#include <algorithm>
#define r(i,a,b) for(int i=a;i<=b;i++)
#define nr(i,a,b) for(int i=a;i>=b;i--)
#define N 200005
using namespace std;
int n,a[N];
long long c[N],left_num[N],right_num[N];
inline void read(int &f) {
char c=getchar();f=0;int ag=1;
while(!isdigit(c)) {if (c=='-') ag=-1; c=getchar();}
while(isdigit(c)){f=(f<<3)+(f<<1)+c-48;c=getchar();}
f*=ag; return;
}
void write(long long x) {
if (x<0) putchar('-'),x*=-1;
if(x>9) write(x/10);putchar(x%10+48);return;
}
inline int lowbit(int x) {return x=x&(-x);}
void insert(int x,int y) {
while(y<=n) {
c[y]+=x;
y+=lowbit(y);
}
}
int getsum(int x) {
int sum=0;
while(x>0) {
sum+=c[x];
x-=lowbit(x);
}
return sum;
}
int main() {
read(n);
r(i,1,n) read(a[i]);
nr(i,n,1) {
int k=getsum(a[i]);
insert(1,a[i]);
right_num[i]=k;
}
r(i,0,n) c[i]=0;
r(i,1,n) {
int k=getsum(a[i]);
insert(1,a[i]);
left_num[i]=k;
}
long long ans1=0;
r(i,1,n) ans1+=left_num[i]*right_num[i];
long long ans2 = 0;
r(i,1,n) ans2+=(i-1-left_num[i])*(n-i-right_num[i]);
write(ans2);putchar(' ');write(ans1);
return 0;
}