80分求助QAQ

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

const int MAXN=1<<18;
const int MOD=1e9+7;

int n;
long long ans;
int tree[MAXN<<1],a[MAXN];
struct rpg{
	int num,id,ren;
}b[MAXN],c[MAXN];

bool cmp(rpg a,rpg b){return a.num<b.num;}
void shel()
{
	for(int i=1;i<=n;++i) c[b[i].id]=b[i];
	for(int i=1;i<=n;++i) b[i]=c[i];
}

void init()
{
	scanf("%d",&n);
	for(int i=1;i<=n;++i) scanf("%d",&b[i]),b[i].id=i;
	sort(b+1,b+n+1,cmp);b[1].ren=1;
	for(int i=2;i<=n;++i){
		if(b[i].num==b[i-1].num) b[i].ren=b[i-1].ren;
		else b[i].ren=b[i-1].ren+1;
	}shel();
	for(int i=1;i<=n;++i){
		if(b[i].ren==b[i-1].ren) continue;
		a[++a[0]]=b[i].ren;
	}return;
}

void solve()
{
	for(int i=1;i<=a[0];++i){
		int l=a[0],r=a[0]+a[i];
		long long sum=0;
		while(l^r^1){
			if(~l&1) sum=(sum+tree[l^1])%MOD;
			if(r&1) sum=(sum+tree[r^1])%MOD;
			l>>=1,r>>=1;
		}tree[a[0]+a[i]]=(tree[a[0]+a[i]]+sum+1)%MOD;
		for(int j=a[0]+a[i]>>1;j;j>>=1) tree[j]=(tree[j<<1]+tree[j<<1|1])%MOD;
		ans=(ans+sum)%MOD;
	}printf("%lld\n",ans);
}

int main()
{
	init();
	solve();
	return 0;
}
//for(int j=1;j<i;++j) if(a[i]>a[j]) f[i]=(f[i]+f[j])%MOD;