Description
(2)
Input
Output
Sample Input
样例输入1:
5
1 5 3 2 4
样例输入2:
4
1 2 4 3
Sample Output
样例输出1:
0
样例输出2:
16777215
Data Constraint
题目问的其实就是
1324-1432-1243
=(1x2x-1423)-(14xx-1423)-(12xx-1234)
=1x2x-14xx-12xx+1234
=1x2x+1234+13xx-1xxx
分别讨论它们吧~
首先设li[i]为在i左下角的点的个数,ri[i]则是右下角
1xxx:简单过
1234:枚举3,“12”
(n−i−ri[i])∗∑j<i,a[j]<a[i]li[j]
,用线段树实现
13xx:枚举3,发现其实要我们求的是(1,3,2)*(n-i-ri[i]),因为4无论是在3,2中间还是在最右边都是合法的
对于 j< i,x< a[i],y< a[i] 一共有li[i]* (a[i]-1)种填法
但是呢多算了两种情况
1:k< i 且y>x这一种多算了li[i]*(li[i]-1)/2
2:y<=x 这一种多算了
∑j<i,a[j]<a[i]a[j]
1x2x:枚举2
发现其实要让我们找的是(1,3,2)*(n-i-ri[i])
对于 j< i,a[j]< a[i] k< i一共有li[i]*(i-1)种填法
同样多算了两种情况
1: k< j 这种情况多算了
∑j<i,a[j]<a[i]j
2:k>=j 且 k< a[i] 这种情况多算了li[i]*(li[i]-1)/2 (其实就是0+1+…+(li[i]-1))
贴代码
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
#define fo(i,a,b) for(i=a;i<=b;i++)
#define ll long long
using namespace std;
const int maxn=2e5+5,md=16777216;
int tree[maxn*3];
int i,j,k,l,m,n,x,y,p;
int a[maxn];
ll li[maxn],ri[maxn];
ll z,ans,c;
void find(int v,int l,int r,int x,int y){
if (l==x && r==y) z=z+tree[v]; else{
int mid=(l+r)/2;
if (y<=mid) find(v*2,l,mid,x,y); else
if (x>mid) find(v*2+1,mid+1,r,x,y); else{
find(v*2,l,mid,x,mid);
find(v*2+1,mid+1,r,mid+1,y);
}
}
}
void change(int v,int l,int r,int x){
if (l==r){
tree[v]=tree[v]+p;
return;
}
int mid=(l+r)/2;
if (x<=mid) change(v*2,l,mid,x); else change(v*2+1,mid+1,r,x);
tree[v]=tree[v*2]+tree[v*2+1];
}
int main(){
// freopen("t3.in","r",stdin);
scanf("%d",&n); p=1;
fo(i,1,n){
scanf("%d",&a[i]); z=0;
find(1,1,n,1,a[i]); li[i]=z; ri[i]=a[i]-li[i]-1;
change(1,1,n,a[i]);
}
memset(tree,0,sizeof(tree));
fo(i,1,n){
z=0; find(1,1,n,1,a[i]);
c=n-i-ri[i];
ans=(ans+z*c)%md;
if (c>2){
z=(((c*(c-1))/2*(c-2))/3)%md;
ans=(ans-z+md)%md;
}
p=li[i]; change(1,1,n,a[i]);
}
memset(tree,0,sizeof(tree));
fo(i,1,n){
z=0; find(1,1,n,1,a[i]);
if (li[i])
z=(md+(md-z)%md+(li[i]*(i-1)-((li[i]*(li[i]-1))/2)%md)%md)%md;
z=(z*(n-i-ri[i]))%md;
ans=(ans+z)%md;
p=i; change(1,1,n,a[i]);
}
memset(tree,0,sizeof(tree));
fo(i,1,n){
z=0; find(1,1,n,1,a[i]);
if (li[i])
z=(md+(md-z)%md+(li[i]*(a[i]-1)-((li[i]*(li[i]-1))/2)%md)%md)%md;
z=(z*(n-i-ri[i]))%md; ans=(ans+z)%md;
p=a[i]; change(1,1,n,a[i]);
}
printf("%lld\n",ans);
return 0;
}